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 23:46Victor MerckléVictor MerckléScore: 5,135Success
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 23:475,09650,051,75641,237,0001,067,0002,113,536
2Jun 28, 2026 23:475,11050,569,41041,320,0001,094,0002,113,536
3Jun 28, 2026 23:475,12150,241,52741,452,0001,058,0002,113,536
4Jun 28, 2026 23:475,13250,330,54941,587,0001,009,0002,113,536
5Jun 28, 2026 23:475,13550,344,83641,536,0001,088,0002,113,536
6Jun 28, 2026 23:475,13650,500,45541,620,0001,009,0002,113,536
7Jun 28, 2026 23:475,16250,714,46841,813,0001,039,0002,113,536
8Jun 28, 2026 23:475,16850,704,03541,881,0001,015,0002,113,536
9Jun 28, 2026 23:475,25851,437,82542,569,0001,080,0002,113,536