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 listSep 6, 2026 10:32Kevin HeaveyKevin HeaveyScore: 3,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:353,51037,425,85427,951,0001,189,0002,113,536
2Sep 6, 2026 10:353,53337,644,86528,134,0001,193,0002,113,536
3Sep 6, 2026 10:353,53637,643,18728,162,0001,190,0002,113,536
4Sep 6, 2026 10:353,54737,714,26828,214,0001,232,0002,113,536
5Sep 6, 2026 10:353,61538,278,71928,797,0001,209,0002,113,536
6Sep 6, 2026 10:353,65838,634,85729,181,0001,184,0002,113,536
7Sep 6, 2026 10:353,71739,155,51629,812,0001,040,0002,113,536
8Sep 6, 2026 10:353,75139,436,32130,101,0001,038,0002,113,536
9Sep 6, 2026 10:353,82239,959,38930,522,0001,203,0002,113,536