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 listMay 1, 2026 10:00limanjun99limanjun99Score: 7,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:017,35280,121,99858,021,0003,001,0002,514,944
2May 1, 2026 10:017,35474,941,10458,040,0003,002,0002,502,656
3May 1, 2026 10:017,37185,328,44759,142,0002,039,0002,502,656
4May 1, 2026 10:017,39680,699,86559,379,0002,012,0002,502,656
5May 1, 2026 10:017,43380,622,57558,713,0002,985,0002,510,848
6May 1, 2026 10:017,44880,507,33558,834,0002,991,0002,510,848
7May 1, 2026 10:017,45684,681,89058,896,0002,994,0002,510,848
8May 1, 2026 10:017,46079,712,79258,924,0002,996,0002,498,560
9May 1, 2026 10:017,46578,318,20258,969,0002,998,0002,514,944