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 listJan 3, 2026 02:07Josu San MartinJosu San MartinScore: 5,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:075,53873,399,10943,966,0001,998,0002,371,584
2Jan 3, 2026 02:075,70769,531,30247,369,00002,347,008
3Jan 3, 2026 02:075,72068,139,89347,479,00002,367,488
4Jan 3, 2026 02:075,79971,101,08146,130,0002,005,0002,519,040
5Jan 3, 2026 02:075,82268,827,18346,306,0002,013,0002,289,664
6Jan 3, 2026 02:076,00374,367,65747,836,0001,993,0002,293,760