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 11:31Victor MerckléVictor MerckléScore: 5,221Success
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 11:325,20350,790,47842,124,0001,067,0002,113,536
2Jun 10, 2026 11:325,20551,174,64042,191,0001,015,0002,113,536
3Jun 10, 2026 11:325,20850,813,01542,158,0001,069,0002,113,536
4Jun 10, 2026 11:325,21150,996,79342,164,0001,093,0002,113,536
5Jun 10, 2026 11:325,22151,297,58342,240,0001,099,0002,113,536
6Jun 10, 2026 11:325,22951,020,74242,375,0001,028,0002,113,536
7Jun 10, 2026 11:325,23551,067,39942,448,0001,008,0002,113,536
8Jun 10, 2026 11:325,27651,530,86342,748,0001,050,0002,113,536
9Jun 10, 2026 11:325,41952,897,09143,894,0001,085,0002,113,536