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 24, 2026 08:10Dominique GarmierDominique GarmierScore: 7,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:127,06081,440,57056,582,0002,020,0002,437,120
2Apr 24, 2026 08:127,08377,023,04755,803,0002,989,0002,433,024
3Apr 24, 2026 08:127,09174,676,56355,866,0002,992,0002,420,736
4Apr 24, 2026 08:127,09275,113,76155,873,0002,993,0002,342,912
5Apr 24, 2026 08:127,10575,526,24755,978,0002,998,0002,441,216
6Apr 24, 2026 08:127,18777,962,97157,632,0002,022,0002,420,736
7Apr 24, 2026 08:127,23777,493,22958,068,0002,002,0002,408,448
8Apr 24, 2026 08:127,24978,666,64157,163,0003,008,0002,342,912
9Apr 24, 2026 08:127,26480,972,74657,279,0003,014,0002,424,832