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 listJun 10, 2026 12:29Victor MerckléVictor MerckléScore: 5,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:305,28151,456,77542,801,0001,032,0002,113,536
2Jun 10, 2026 12:305,28551,453,86542,837,0001,030,0002,113,536
3Jun 10, 2026 12:305,28651,475,38942,870,0001,005,0002,113,536
4Jun 10, 2026 12:305,42852,790,43944,032,0001,021,0002,113,536
5Jun 10, 2026 12:305,43253,959,51844,086,0001,005,0002,113,536
6Jun 10, 2026 12:305,46153,217,93044,284,0001,044,0002,113,536
7Jun 10, 2026 12:305,46853,208,25544,384,0001,008,0002,113,536
8Jun 10, 2026 12:305,47052,853,26044,384,0001,024,0002,113,536
9Jun 10, 2026 12:305,52353,454,23444,750,0001,094,0002,113,536