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 listAug 28, 2026 15:53Victor MerckléVictor MerckléScore: 4,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:534,26343,608,27834,295,0001,093,0002,113,536
2Aug 28, 2026 15:534,26743,786,14834,318,0001,100,0002,113,536
3Aug 28, 2026 15:534,27343,870,93834,371,0001,097,0002,113,536
4Aug 28, 2026 15:534,28343,723,69534,452,0001,099,0002,113,536
5Aug 28, 2026 15:534,28643,926,87734,484,0001,095,0002,113,536
6Aug 28, 2026 15:534,30250,817,36634,441,0001,267,0002,113,536
7Aug 28, 2026 15:534,34344,212,08034,937,0001,115,0002,113,536
8Aug 28, 2026 15:534,35053,145,88435,097,0001,015,0002,113,536
9Aug 28, 2026 15:534,36755,068,91035,126,0001,124,0002,113,536