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 15:04Andrew EpsteinAndrew EpsteinScore: 143,590Success
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 15:06143,3371,199,992,3041,188,701,0001,001,0002,117,632stderr
2Sep 17, 2026 15:06143,4621,201,100,1191,189,737,0001,001,0002,117,632stderr
3Sep 17, 2026 15:06143,5071,201,427,8091,190,106,0001,005,0002,117,632stderr
4Sep 17, 2026 15:06143,5491,201,669,1981,190,457,0001,003,0002,117,632stderr
5Sep 17, 2026 15:06143,5901,201,991,5521,190,792,0001,007,0002,117,632stderr
6Sep 17, 2026 15:06143,6361,202,384,0321,191,183,0001,002,0002,117,632stderr
7Sep 17, 2026 15:06143,7011,203,082,8141,190,665,0002,054,0002,117,632stderr
8Sep 17, 2026 15:06143,9421,206,320,2951,193,721,0001,004,0002,117,632stderr
9Sep 17, 2026 15:06144,3491,208,360,7481,195,991,0002,108,0002,117,632stderr