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 26, 2026 15:22wnwnScore: 3,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:233,47047,140,90526,819,0001,986,0002,486,272
2Apr 26, 2026 15:233,47044,360,01326,818,0001,986,0002,469,888
3Apr 26, 2026 15:233,47444,818,63026,850,0001,988,0002,490,368
4Apr 26, 2026 15:233,48641,956,66026,946,0001,996,0002,486,272
5Apr 26, 2026 15:233,49546,768,99027,014,0002,001,0002,482,176
6Apr 26, 2026 15:233,50647,686,55427,097,0002,007,0002,486,272
7Apr 26, 2026 15:233,51346,362,47928,156,0001,005,0002,482,176
8Apr 26, 2026 15:233,57444,378,21627,688,0001,977,0002,494,464
9Apr 26, 2026 15:233,65947,729,16230,377,00002,555,904