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 24, 2026 04:19wnwnScore: 3,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:203,31436,308,97826,481,0001,027,0002,113,536
2Sep 24, 2026 04:203,31636,322,83026,523,0001,002,0002,113,536
3Sep 24, 2026 04:203,31736,357,04026,507,0001,028,0002,113,536
4Sep 24, 2026 04:203,32436,343,62026,559,0001,036,0002,113,536
5Sep 24, 2026 04:203,32836,361,03826,619,0001,007,0002,113,536
6Sep 24, 2026 04:203,33836,477,32226,708,0001,005,0002,113,536
7Sep 24, 2026 04:203,46637,570,16327,769,0001,002,0002,113,536
8Sep 24, 2026 04:203,47339,597,39127,751,0001,082,0002,113,536
9Sep 24, 2026 04:203,47838,373,28827,833,0001,039,0002,113,536