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 8, 2026 22:32zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 22:33044,500,67128,877,0001,106,0002,424,832expected "53683816942318606 ", got "53683816997038225 "
2May 8, 2026 22:333,41746,135,33827,274,0001,095,0002,433,024
3May 8, 2026 22:333,60345,144,68928,814,0001,097,0002,416,640
4May 8, 2026 22:333,60344,354,56528,805,0001,105,0002,428,928
5May 8, 2026 22:333,61745,131,54628,930,0001,097,0002,424,832
6May 8, 2026 22:333,62844,970,36329,020,0001,100,0002,424,832
7May 8, 2026 22:333,64446,926,88429,129,0001,122,0002,424,832
8May 8, 2026 22:333,66347,510,26829,287,0001,122,0002,424,832
9May 8, 2026 22:333,67245,408,62529,360,0001,124,0002,424,832