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 listSep 17, 2026 16:41Andrew EpsteinAndrew EpsteinScore: 9,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:439,68488,890,74279,302,0001,076,0002,117,632stderr
2Sep 17, 2026 16:439,76189,480,86779,927,0001,093,0002,117,632stderr
3Sep 17, 2026 16:439,77189,648,40479,980,0001,120,0002,117,632stderr
4Sep 17, 2026 16:439,80390,039,14480,304,0001,064,0002,117,632stderr
5Sep 17, 2026 16:439,80690,138,09880,312,0001,086,0002,117,632stderr
6Sep 17, 2026 16:439,84590,465,34880,651,0001,068,0002,117,632stderr
7Sep 17, 2026 16:439,85090,532,34080,661,0001,097,0002,117,632stderr
8Sep 17, 2026 16:439,86790,532,32480,829,0001,072,0002,117,632stderr
9Sep 17, 2026 16:439,87490,550,27780,879,0001,082,0002,117,632stderr