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:23Kevin HeaveyKevin HeaveyScore: 3,776Success
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:243,51937,600,93328,160,0001,051,0002,113,536
2Sep 6, 2026 11:243,52337,896,26028,198,0001,043,0002,113,536
3Sep 6, 2026 11:243,54337,888,74428,320,0001,087,0002,113,536
4Sep 6, 2026 11:243,75039,563,33630,045,0001,087,0002,113,536
5Sep 6, 2026 11:243,77640,000,34330,308,0001,033,0002,113,536
6Sep 6, 2026 11:243,78539,841,88530,330,0001,093,0002,113,536
7Sep 6, 2026 11:243,79039,894,10330,381,0001,084,0002,113,536
8Sep 6, 2026 11:243,79940,679,21130,507,0001,032,0002,113,536
9Sep 6, 2026 11:243,80541,805,18630,327,0001,257,0002,113,536