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 22, 2026 05:16wnwnScore: 3,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:173,53945,331,08528,366,0001,013,0002,490,368
2Apr 22, 2026 05:173,54545,577,16828,415,0001,014,0002,490,368
3Apr 22, 2026 05:173,55145,002,67428,458,0001,016,0002,486,272
4Apr 22, 2026 05:173,56842,311,58128,601,0001,021,0002,494,464
5Apr 22, 2026 05:173,56846,683,98328,601,0001,021,0002,482,176
6Apr 22, 2026 05:173,58545,953,27427,777,0001,984,0002,330,624
7Apr 22, 2026 05:173,59144,688,56527,824,0001,987,0002,330,624
8Apr 22, 2026 05:173,69645,930,61929,656,0001,022,0002,551,808
9Apr 22, 2026 05:173,73643,565,74329,011,0002,000,0002,490,368