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 13, 2026 11:55wnwnScore: 4,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:554,10756,684,51832,081,0002,005,0002,277,376
2Apr 13, 2026 11:554,13857,417,98933,339,0001,010,0002,277,376
3Apr 13, 2026 11:554,20657,902,05332,914,0001,994,0002,490,368