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 listMar 4, 2026 07:12DanielDanielScore: 52,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:1252,729466,305,527436,649,000999,0002,293,760
2Mar 4, 2026 07:1252,743468,469,788435,768,0001,998,0002,293,760
3Mar 4, 2026 07:1252,755461,303,168435,871,0001,999,0002,293,760
4Mar 4, 2026 07:1252,761459,768,052436,918,000999,0002,359,296
5Mar 4, 2026 07:1252,762465,000,620433,929,0003,999,0002,289,664
6Mar 4, 2026 07:1252,787461,693,148437,130,0001,000,0002,293,760
7Mar 4, 2026 07:1252,874464,313,401436,854,0001,999,0002,371,584
8Mar 4, 2026 07:1253,212467,945,690439,665,0001,998,0002,363,392
9Mar 4, 2026 07:1253,446472,513,598443,604,00002,293,760