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 listJul 23, 2026 01:00Kevin HeaveyKevin HeaveyScore: 75,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 01:0174,834630,926,811618,887,0002,241,0002,113,536
2Jul 23, 2026 01:0174,953631,987,240619,788,0002,329,0002,113,536
3Jul 23, 2026 01:0175,376635,461,553623,297,0002,332,0002,113,536
4Jul 23, 2026 01:0175,481636,298,630624,196,0002,297,0002,113,536
5Jul 23, 2026 01:0175,773638,678,213626,637,0002,285,0002,113,536
6Jul 23, 2026 01:0175,813641,762,708626,877,0002,371,0002,113,536
7Jul 23, 2026 01:0175,930640,060,762627,879,0002,340,0002,113,536
8Jul 23, 2026 01:0175,998640,561,343628,519,0002,272,0002,113,536
9Jul 23, 2026 01:0176,248642,698,749630,568,0002,293,0002,113,536