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 listMay 14, 2026 03:13Victor MerckléVictor MerckléScore: 7,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 03:147,19668,806,89658,728,0001,005,0002,113,536
2May 14, 2026 03:147,19768,149,87458,700,0001,039,0002,113,536
3May 14, 2026 03:147,19869,084,14858,737,0001,007,0002,113,536
4May 14, 2026 03:147,19968,010,09458,733,0001,026,0002,113,536
5May 14, 2026 03:147,20169,056,58458,770,0001,001,0002,113,536
6May 14, 2026 03:147,20267,650,58158,766,0001,017,0002,113,536
7May 14, 2026 03:147,20468,074,77758,783,0001,012,0002,113,536
8May 14, 2026 03:147,25369,441,56759,202,0001,002,0002,113,536
9May 14, 2026 03:147,25869,615,66759,221,0001,022,0002,113,536