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 16, 2026 09:25Hung T.NguyenHung T.NguyenScore: 40,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 09:2540,116354,397,310328,967,0003,999,0002,265,088
2Mar 16, 2026 09:2540,125358,954,718331,041,0002,000,0002,400,256
3Mar 16, 2026 09:2540,210357,911,821330,746,0002,997,0002,265,088
4Mar 16, 2026 09:2540,224357,535,181331,864,0001,999,0002,400,256
5Mar 16, 2026 09:2540,229358,028,605331,900,0001,999,0002,396,160
6Mar 16, 2026 09:2540,231357,988,533332,920,000999,0002,265,088
7Mar 16, 2026 09:2540,236361,907,215330,961,0002,999,0002,392,064
8Mar 16, 2026 09:2540,249362,857,759333,069,0001,000,0002,265,088
9Mar 16, 2026 09:2540,293360,120,201334,428,00002,265,088