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 27, 2026 10:10wnwnScore: 3,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:123,43244,814,55527,470,0001,017,0002,502,656
2Apr 27, 2026 10:123,44645,724,46827,586,0001,021,0002,482,176
3Apr 27, 2026 10:123,45547,998,34627,653,0001,024,0002,490,368
4Apr 27, 2026 10:123,46345,052,72127,722,0001,026,0002,330,624
5Apr 27, 2026 10:123,50946,286,72627,117,0002,008,0002,490,368
6Apr 27, 2026 10:123,55743,966,15128,507,0001,018,0002,490,368
7Apr 27, 2026 10:123,59044,647,11328,772,0001,027,0002,486,272
8Apr 27, 2026 10:123,63744,397,20529,189,0001,006,0002,494,464
9Apr 27, 2026 10:123,64951,260,29029,278,0001,009,0002,482,176