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 listSep 6, 2026 03:31CheckHarryCheckHarryScore: 3,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:323,89642,305,13931,281,0001,059,0002,113,536
2Sep 6, 2026 03:323,89642,184,94831,332,0001,009,0002,113,536
3Sep 6, 2026 03:323,90242,257,42131,351,0001,037,0002,113,536
4Sep 6, 2026 03:323,90343,422,93231,365,0001,030,0002,113,536
5Sep 6, 2026 03:323,90442,515,34931,395,0001,010,0002,113,536
6Sep 6, 2026 03:323,97642,916,86531,984,0001,024,0002,113,536
7Sep 6, 2026 03:323,97642,824,10931,982,0001,022,0002,113,536
8Sep 6, 2026 03:323,99242,996,54832,117,0001,020,0002,113,536
9Sep 6, 2026 03:324,01043,262,68632,244,0001,041,0002,113,536