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 listAug 30, 2026 22:39Josu San MartinJosu San MartinScore: 4,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:434,22844,823,81434,067,0001,032,0002,113,536
2Aug 30, 2026 22:434,23143,576,69234,087,0001,038,0002,113,536
3Aug 30, 2026 22:434,23443,609,67634,105,0001,041,0002,113,536
4Aug 30, 2026 22:434,23943,636,66334,147,0001,038,0002,113,536
5Aug 30, 2026 22:434,24343,808,96634,182,0001,043,0002,113,536
6Aug 30, 2026 22:434,25043,669,79134,240,0001,038,0002,113,536
7Aug 30, 2026 22:434,25143,734,67734,235,0001,049,0002,113,536
8Aug 30, 2026 22:434,26943,842,24134,405,0001,035,0002,113,536
9Aug 30, 2026 22:434,41045,015,28035,495,0001,115,0002,113,536