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 16:39Victor MerckléVictor MerckléScore: 4,582Success
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 16:414,55645,765,75436,742,0001,073,0002,113,536
2May 21, 2026 16:414,55945,657,54636,779,0001,067,0002,113,536
3May 21, 2026 16:414,57945,883,02436,983,0001,023,0002,113,536
4May 21, 2026 16:414,58245,891,12936,972,0001,065,0002,113,536
5May 21, 2026 16:414,58245,845,80337,006,0001,026,0002,113,536
6May 21, 2026 16:414,58747,302,30937,040,0001,036,0002,113,536
7May 21, 2026 16:414,59246,418,75037,102,0001,018,0002,113,536
8May 21, 2026 16:414,60646,488,37037,227,0001,009,0002,113,536
9May 21, 2026 16:414,80147,759,63838,848,0001,004,0002,113,536