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 10, 2026 16:02Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 16:03047,716,40333,344,0001,053,0002,113,536expected "53682382216229811 ", got "53682382140505910 "
2May 10, 2026 16:034,12343,847,33633,204,0001,020,0002,113,536
3May 10, 2026 16:034,12443,639,96833,200,0001,032,0002,113,536
4May 10, 2026 16:034,12542,160,66133,191,0001,047,0002,113,536
5May 10, 2026 16:034,13242,485,38633,269,0001,029,0002,113,536
6May 10, 2026 16:034,13242,046,88933,272,0001,025,0002,113,536
7May 10, 2026 16:034,14342,337,05633,374,0001,015,0002,113,536
8May 10, 2026 16:034,16143,715,44033,520,0001,021,0002,113,536
9May 10, 2026 16:034,17743,828,72933,603,0001,070,0002,113,536