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 listFeb 16, 2026 19:44wnwnScore: 8,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:447,38888,096,56157,297,0004,020,0002,265,088
2Feb 16, 2026 19:447,57897,032,98259,904,0002,995,0002,334,720
3Feb 16, 2026 19:447,60187,829,15160,087,0003,004,0002,367,488
4Feb 16, 2026 19:448,44594,582,70868,088,0002,002,0002,297,856
5Feb 16, 2026 19:448,61596,382,51767,479,0004,028,0002,351,104
6Feb 16, 2026 19:448,83995,388,27671,355,0002,010,0002,285,568