Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 29, 2026 13:30Victor MerckléVictor MerckléScore: 4,226Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:304,19743,249,10433,747,0001,091,0002,117,632stderr
2Aug 29, 2026 13:304,20743,319,96833,807,0001,114,0002,117,632stderr
3Aug 29, 2026 13:304,20744,158,47333,814,0001,112,0002,117,632stderr
4Aug 29, 2026 13:304,20844,002,68733,801,0001,126,0002,117,632stderr
5Aug 29, 2026 13:304,22643,463,32333,956,0001,121,0002,117,632stderr
6Aug 29, 2026 13:304,22743,445,08634,017,0001,071,0002,117,632stderr
7Aug 29, 2026 13:304,23044,081,42734,002,0001,115,0002,117,632stderr
8Aug 29, 2026 13:304,23343,477,11334,076,0001,064,0002,117,632stderr
9Aug 29, 2026 13:304,23543,569,51034,052,0001,099,0002,117,632stderr