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 11, 2026 18:42Josu San MartinJosu San MartinScore: 5,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 18:405,12467,456,87142,526,00002,289,664
2Apr 11, 2026 18:425,13367,560,94940,572,0002,028,0002,289,664
3Apr 11, 2026 18:405,16164,843,28240,845,0001,992,0002,338,816
4Apr 11, 2026 18:425,18669,208,15142,043,0001,001,0002,498,560
5Apr 11, 2026 18:425,19767,742,52242,129,0001,003,0002,502,656
6Apr 11, 2026 18:405,45370,245,50443,245,0002,011,0002,498,560