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 listApr 6, 2026 16:46Danylo MocherniukDanylo MocherniukScore: 6,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 16:465,98376,151,79448,646,0001,013,0002,404,352
2Apr 6, 2026 16:466,01369,620,24447,911,0001,996,0002,297,856
3Apr 6, 2026 16:466,03176,443,39348,058,0002,002,0002,297,856
4Apr 6, 2026 16:466,04076,325,48347,122,0003,007,0002,297,856
5Apr 6, 2026 16:466,06478,160,07548,315,0002,013,0002,400,256
6Apr 6, 2026 16:466,06776,974,13249,346,0001,007,0002,392,064