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 1, 2026 14:03kkxkkxScore: 68,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2026 14:0368,232593,430,824472,438,00093,888,0002,498,560
2Feb 1, 2026 14:0368,308593,068,160471,967,00094,993,0002,441,216
3Feb 1, 2026 14:0368,351595,539,784474,423,00092,887,0002,486,272
4Feb 1, 2026 14:0368,353594,391,737479,431,00087,895,0002,523,136
5Feb 1, 2026 14:0368,356591,293,668476,457,00090,896,0002,490,368
6Feb 1, 2026 14:0368,357596,107,974470,469,00096,890,0002,437,120
7Feb 1, 2026 14:0368,973598,625,041475,563,00096,911,0002,289,664
8Feb 1, 2026 14:0369,248599,492,320479,802,00094,960,0002,506,752
9Feb 1, 2026 14:0369,446599,932,060477,507,00098,897,0002,494,464