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 20, 2026 20:32Ondřej PolaneckýOndřej PolaneckýScore: 10,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 02:1810,823116,443,14887,838,0001,996,0002,269,184
2Mar 20, 2026 20:3210,881117,801,66888,306,0002,006,0002,289,664
3Mar 19, 2026 02:1810,890113,192,91788,382,0002,008,0002,289,664
4Mar 19, 2026 02:1810,895112,500,72587,415,0003,014,0002,289,664
5Mar 20, 2026 20:3210,898113,172,46689,447,0001,005,0002,531,328
6Mar 20, 2026 20:3210,944116,086,20988,842,0001,996,0002,265,088