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 28, 2026 18:07glegleScore: 45,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 18:0844,928382,255,930371,905,0001,002,0002,113,536
2Jun 28, 2026 18:0844,939382,376,282371,985,0001,009,0002,113,536
3Jun 28, 2026 18:0844,953382,546,391372,096,0001,017,0002,113,536
4Jun 28, 2026 18:0844,962382,505,364372,186,0001,004,0002,113,536
5Jun 28, 2026 18:0845,007382,796,353372,561,0001,004,0002,113,536
6Jun 28, 2026 18:0845,008382,942,002372,570,0001,004,0002,113,536
7Jun 28, 2026 18:0845,047383,165,729372,888,0001,003,0002,113,536
8Jun 28, 2026 18:0845,073383,425,934373,102,0001,004,0002,113,536
9Jun 28, 2026 18:0845,094383,576,443373,283,0001,002,0002,113,536