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 listMar 28, 2026 20:33Ondřej PolaneckýOndřej PolaneckýScore: 8,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 20:338,34591,658,38568,262,0001,003,0002,281,472
2Mar 28, 2026 20:338,34692,542,09867,263,0002,007,0002,281,472
3Mar 28, 2026 20:338,35592,292,13769,347,00002,281,472
4Mar 28, 2026 20:338,35894,471,80668,364,0001,005,0002,281,472
5Mar 28, 2026 20:338,36392,221,80969,409,00002,281,472
6Mar 28, 2026 20:338,36689,306,44869,438,00002,510,848
7Mar 28, 2026 20:338,37091,587,82968,468,0001,006,0002,400,256
8Mar 28, 2026 20:338,37094,166,95469,473,00002,400,256
9Mar 28, 2026 20:338,40999,922,03269,792,00002,396,160