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 03:46Josu San MartinJosu San MartinScore: 4,472Success
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 03:464,45653,478,37235,809,0001,179,0002,543,616
2May 10, 2026 03:464,47049,633,37436,075,0001,032,0002,543,616
3May 10, 2026 03:464,47052,695,05636,067,0001,037,0002,560,000
4May 10, 2026 03:464,47053,278,22436,055,0001,052,0002,560,000
5May 10, 2026 03:464,47252,964,53836,086,0001,037,0002,539,520
6May 10, 2026 03:464,47252,585,35936,008,0001,110,0002,555,904
7May 10, 2026 03:464,48149,990,23036,076,0001,121,0002,543,616
8May 10, 2026 03:464,48151,317,43836,180,0001,020,0002,543,616
9May 10, 2026 03:464,50755,113,10736,362,0001,054,0002,551,808