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 listJul 3, 2026 17:23Josu San MartinJosu San MartinScore: 75,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:2374,942631,363,051620,925,0001,095,0002,113,536
2Jul 3, 2026 17:2375,430635,536,807624,961,0001,111,0002,113,536
3Jul 3, 2026 17:2375,443636,897,938625,143,0001,038,0002,113,536
4Jul 3, 2026 17:2375,446635,605,187625,180,0001,026,0002,113,536
5Jul 3, 2026 17:2375,455635,781,114625,168,0001,109,0002,113,536
6Jul 3, 2026 17:2375,576636,736,176626,205,0001,081,0002,113,536
7Jul 3, 2026 17:2375,770638,321,749627,824,0001,074,0002,113,536
8Jul 3, 2026 17:2375,971639,905,074629,468,0001,096,0002,113,536
9Jul 3, 2026 17:2376,329642,969,762632,430,0001,103,0002,113,536