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 22, 2026 06:56Kevin HeaveyKevin HeaveyScore: 4,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 07:034,12544,122,72630,080,0004,163,0002,117,632
2Jul 22, 2026 07:034,14744,337,65430,281,0004,144,0002,117,632
3Jul 22, 2026 07:034,16744,839,61130,401,0004,188,0002,117,632
4Jul 22, 2026 07:034,24945,925,70031,116,0004,158,0002,117,632
5Jul 22, 2026 07:034,26245,907,61931,254,0004,124,0002,117,632
6Jul 22, 2026 07:034,26845,891,56431,324,0004,103,0002,117,632
7Jul 22, 2026 07:034,30545,639,51031,619,0004,116,0002,121,728
8Jul 22, 2026 07:034,31846,223,68831,601,0004,242,0002,117,632
9Jul 22, 2026 07:034,35946,771,46031,953,0004,233,0002,117,632