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 11:08Kevin HeaveyKevin HeaveyScore: 3,559Success
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 11:103,52338,023,16228,193,0001,050,0002,113,536
2Sep 6, 2026 11:103,52839,688,54228,059,0001,227,0002,113,536
3Sep 6, 2026 11:103,53340,349,16828,278,0001,053,0002,113,536
4Sep 6, 2026 11:103,53739,612,06128,325,0001,040,0002,113,536
5Sep 6, 2026 11:103,55940,397,56328,501,0001,039,0002,113,536
6Sep 6, 2026 11:103,56838,147,77628,380,0001,237,0002,113,536
7Sep 6, 2026 11:103,58838,190,89828,576,0001,207,0002,113,536
8Sep 6, 2026 11:103,59839,992,73628,769,0001,100,0002,113,536
9Sep 6, 2026 11:103,63138,476,18328,936,0001,208,0002,113,536