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 11, 2026 01:14Josu San MartinJosu San MartinScore: 15,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:1415,273134,563,874125,702,0001,067,0002,113,536
2May 11, 2026 01:1415,282134,544,541125,787,0001,054,0002,113,536
3May 11, 2026 01:1415,293136,071,525125,888,0001,051,0002,113,536
4May 11, 2026 01:1415,297137,081,555125,898,0001,069,0002,113,536
5May 11, 2026 01:1415,298134,792,814125,911,0001,065,0002,113,536
6May 11, 2026 01:1415,308137,809,314125,905,0001,157,0002,113,536
7May 11, 2026 01:1415,309136,944,397126,003,0001,063,0002,113,536
8May 11, 2026 01:1415,316134,750,607126,033,0001,096,0002,113,536
9May 11, 2026 01:1415,318136,011,040125,995,0001,147,0002,113,536