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 17:35Josu San MartinJosu San MartinScore: 38,914Success
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 17:3638,890332,033,239321,785,0001,004,0002,113,536
2Jul 3, 2026 17:3638,895332,205,183321,825,0001,005,0002,113,536
3Jul 3, 2026 17:3638,898332,180,098321,851,0001,004,0002,113,536
4Jul 3, 2026 17:3638,901332,193,645321,878,0001,004,0002,113,536
5Jul 3, 2026 17:3638,914332,292,992321,985,0001,006,0002,113,536
6Jul 3, 2026 17:3638,919332,344,913322,026,0001,005,0002,113,536
7Jul 3, 2026 17:3638,924332,466,320322,072,0001,005,0002,113,536
8Jul 3, 2026 17:3638,932332,519,142322,138,0001,004,0002,113,536
9Jul 3, 2026 17:3638,951333,153,759322,290,0001,004,0002,113,536