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 3, 2026 20:33Josu San MartinJosu San MartinScore: 39,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:3439,963341,400,673330,693,0001,004,0002,113,536
2Jul 3, 2026 20:3439,968341,156,152330,736,0001,004,0002,113,536
3Jul 3, 2026 20:3439,968341,095,860330,736,0001,005,0002,113,536
4Jul 3, 2026 20:3439,972341,114,499330,765,0001,005,0002,113,536
5Jul 3, 2026 20:3439,977342,731,547330,812,0001,005,0002,113,536
6Jul 3, 2026 20:3439,977341,276,758330,813,0001,003,0002,113,536
7Jul 3, 2026 20:3439,990341,362,795330,922,0001,003,0002,113,536
8Jul 3, 2026 20:3439,993341,466,469330,937,0001,005,0002,113,536
9Jul 3, 2026 20:3440,007341,461,019331,060,0001,005,0002,113,536