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 13, 2026 17:54M-RochatM-RochatScore: 25,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:5525,938225,865,865214,270,0001,021,0002,113,536
2May 13, 2026 17:5525,953226,067,222214,401,0001,017,0002,113,536
3May 13, 2026 17:5525,957224,388,310214,420,0001,031,0002,113,536
4May 13, 2026 17:5525,959224,132,485214,434,0001,027,0002,113,536
5May 13, 2026 17:5525,960224,244,408214,445,0001,027,0002,113,536
6May 13, 2026 17:5525,967226,010,634214,473,0001,060,0002,113,536
7May 13, 2026 17:5525,974226,675,023214,562,0001,025,0002,113,536
8May 13, 2026 17:5526,003226,321,377214,826,0001,003,0002,113,536
9May 13, 2026 17:5526,030227,635,685215,017,0001,038,0002,113,536