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 12, 2026 15:16Kevin HeaveyKevin HeaveyScore: 4,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:184,04243,119,55032,344,0001,206,0002,117,632
2Jul 12, 2026 15:184,05543,253,30732,627,0001,036,0002,117,632
3Jul 12, 2026 15:184,05743,343,29732,656,0001,024,0002,117,632
4Jul 12, 2026 15:184,05943,284,58732,670,0001,021,0002,117,632
5Jul 12, 2026 15:184,06143,315,53732,689,0001,023,0002,117,632
6Jul 12, 2026 15:184,06343,355,03732,530,0001,195,0002,117,632
7Jul 12, 2026 15:184,06443,368,72932,513,0001,225,0002,117,632
8Jul 12, 2026 15:184,06543,326,26332,719,0001,022,0002,117,632
9Jul 12, 2026 15:184,09943,701,59832,998,0001,031,0002,117,632