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 19, 2026 21:51Victor MerckléVictor MerckléScore: 8,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 21:518,68879,633,25071,018,0001,093,0002,113,536
2Jun 19, 2026 21:518,70380,315,12771,154,0001,081,0002,113,536
3Jun 19, 2026 21:518,71179,911,55771,207,0001,099,0002,113,536
4Jun 19, 2026 21:518,73680,180,00671,298,0001,211,0002,113,536
5Jun 19, 2026 21:518,73980,610,19171,392,0001,147,0002,113,536
6Jun 19, 2026 21:518,74080,622,85071,451,0001,099,0002,113,536
7Jun 19, 2026 21:518,76980,886,19571,630,0001,158,0002,113,536
8Jun 19, 2026 21:518,97182,122,03073,358,0001,105,0002,113,536
9Jun 19, 2026 21:519,01282,887,77873,642,0001,159,0002,113,536