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 12, 2026 16:05Kevin HeaveyKevin HeaveyScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:063,56338,409,07328,540,0001,040,0002,113,536
2Sep 12, 2026 16:063,62539,023,66928,848,0001,241,0002,113,536
3Sep 12, 2026 16:063,82640,501,79430,521,0001,237,0002,113,536
4Sep 12, 2026 16:063,83140,778,70330,760,0001,042,0002,113,536
5Sep 12, 2026 16:063,83440,618,17530,586,0001,237,0002,113,536
6Sep 12, 2026 16:063,85740,794,47730,984,0001,032,0002,113,536
7Sep 12, 2026 16:063,85842,360,82630,994,0001,033,0002,113,536
8Sep 12, 2026 16:063,86640,980,49130,859,0001,233,0002,113,536
9Sep 12, 2026 16:063,90545,589,95031,304,0001,113,0002,113,536