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 21, 2026 10:39Victor MerckléVictor MerckléScore: 13,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:4013,917123,376,636114,456,0001,062,0002,113,536
2May 21, 2026 10:4013,919123,624,370114,473,0001,061,0002,113,536
3May 21, 2026 10:4013,931123,515,590114,573,0001,058,0002,113,536
4May 21, 2026 10:4013,938123,490,038114,631,0001,060,0002,113,536
5May 21, 2026 10:4013,944124,005,608114,666,0001,075,0002,113,536
6May 21, 2026 10:4013,968124,208,240114,916,0001,021,0002,113,536
7May 21, 2026 10:4013,977123,823,966114,978,0001,033,0002,113,536
8May 21, 2026 10:4013,985123,932,368114,973,0001,108,0002,113,536
9May 21, 2026 10:4014,053125,647,717115,585,0001,061,0002,113,536