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 2, 2026 19:24George SeabridgeGeorge SeabridgeScore: 7,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:247,29870,585,59958,300,0002,279,0002,113,536
2Aug 2, 2026 19:247,30570,534,66858,406,0002,229,0002,113,536
3Aug 2, 2026 19:247,31771,454,41858,498,0002,234,0002,113,536
4Aug 2, 2026 19:247,50872,178,02860,071,0002,251,0002,113,536
5Aug 2, 2026 19:247,71473,990,31661,788,0002,242,0002,117,632
6Aug 2, 2026 19:247,77574,441,79962,342,0002,191,0002,113,536
7Aug 2, 2026 19:247,79974,659,22962,490,0002,244,0002,113,536
8Aug 2, 2026 19:247,85075,061,82562,965,0002,192,0002,113,536
9Aug 2, 2026 19:247,86175,827,21963,023,0002,224,0002,113,536