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 06:57Kevin HeaveyKevin HeaveyScore: 3,619Success
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 06:593,58339,355,31628,692,0001,048,0002,113,536
2Jul 21, 2026 06:593,59039,450,94328,748,0001,049,0002,113,536
3Jul 21, 2026 06:593,60339,590,55728,858,0001,054,0002,113,536
4Jul 21, 2026 06:593,61339,603,03128,963,0001,027,0002,113,536
5Jul 21, 2026 06:593,61939,680,90828,992,0001,049,0002,113,536
6Jul 21, 2026 06:593,62039,760,37029,003,0001,051,0002,113,536
7Jul 21, 2026 06:593,62339,765,70929,025,0001,052,0002,113,536
8Jul 21, 2026 06:593,63039,779,97729,085,0001,050,0002,113,536
9Jul 21, 2026 06:593,64642,484,32429,215,0001,054,0002,113,536