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 listApr 3, 2026 08:42SODIUM IS NOT A CATSODIUM IS NOT A CATScore: 53,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 08:4253,115474,045,463438,855,0001,999,0002,277,376
2Apr 3, 2026 08:4253,211471,824,740439,650,0001,998,0002,527,232
3Apr 3, 2026 08:4253,211472,032,042439,653,0001,998,0002,277,376
4Apr 3, 2026 08:4253,213466,216,399438,668,0002,997,0002,265,088
5Apr 3, 2026 08:4253,215466,689,659438,691,0002,997,0002,277,376
6Apr 3, 2026 08:4253,223473,228,507439,754,0001,998,0002,293,760
7Apr 3, 2026 08:4253,224471,793,768438,758,0002,998,0002,269,184
8Apr 3, 2026 08:4253,233467,267,501440,833,000999,0002,523,136
9Apr 3, 2026 08:4253,247467,371,264439,950,0001,999,0002,277,376