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 19:18Josu San MartinJosu San MartinScore: 18,529Success
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 19:1918,300161,306,445148,245,0003,648,0002,113,536
2Jul 3, 2026 19:1918,314161,440,245148,442,0003,572,0002,113,536
3Jul 3, 2026 19:1918,323161,572,584148,454,0003,634,0002,113,536
4Jul 3, 2026 19:1918,507162,932,862150,043,0003,569,0002,113,536
5Jul 3, 2026 19:1918,529163,152,982150,271,0003,525,0002,113,536
6Jul 3, 2026 19:1918,559163,393,644150,511,0003,532,0002,113,536
7Jul 3, 2026 19:1918,616163,866,090150,848,0003,667,0002,113,536
8Jul 3, 2026 19:1918,622163,977,812150,838,0003,732,0002,113,536
9Jul 3, 2026 19:1918,675164,439,347151,428,0003,575,0002,113,536