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 17, 2026 02:34Kevin HeaveyKevin HeaveyScore: 3,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 02:393,73240,677,55029,930,0001,052,0002,113,536
2Jul 17, 2026 02:393,73248,617,02129,927,0001,052,0002,113,536
3Jul 17, 2026 02:393,74140,775,93630,003,0001,051,0002,113,536
4Jul 17, 2026 02:393,74340,793,27530,020,0001,050,0002,113,536
5Jul 17, 2026 02:393,74742,400,07329,952,0001,153,0002,113,536
6Jul 17, 2026 02:393,78141,142,96430,333,0001,051,0002,113,536
7Jul 17, 2026 02:393,79441,258,95030,446,0001,052,0002,113,536
8Jul 17, 2026 02:393,86841,859,88631,061,0001,048,0002,113,536
9Jul 17, 2026 02:394,03843,225,51832,493,0001,023,0002,113,536