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 listJul 21, 2026 19:51Kevin HeaveyKevin HeaveyScore: 4,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 19:524,30645,318,33633,569,0002,179,0002,117,632
2Jul 21, 2026 19:524,31045,465,85833,587,0002,192,0002,117,632
3Jul 21, 2026 19:524,31745,472,52933,681,0002,153,0002,121,728
4Jul 21, 2026 19:524,33845,692,78733,844,0002,165,0002,117,632
5Jul 21, 2026 19:524,35445,705,26433,959,0002,184,0002,117,632
6Jul 21, 2026 19:524,35745,798,20234,008,0002,160,0002,117,632
7Jul 21, 2026 19:524,37445,959,58134,152,0002,153,0002,117,632
8Jul 21, 2026 19:524,38145,947,06334,191,0002,178,0002,117,632
9Jul 21, 2026 19:524,44246,508,34734,824,0002,051,0002,117,632