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 listOct 19, 2026 17:23DanielDanielScore: 8,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 17:238,55085,092,85469,953,0001,017,00024,576
2Oct 19, 2026 17:238,61482,559,48370,485,0001,018,00024,576
3Oct 19, 2026 17:238,61982,368,12470,523,0001,022,0002,117,632
4Oct 19, 2026 17:238,62882,490,47970,595,0001,022,0002,117,632
5Oct 19, 2026 17:238,63682,566,11870,663,0001,024,0002,117,632
6Oct 19, 2026 17:239,25787,709,95973,173,0003,662,00024,576
7Oct 19, 2026 17:239,30188,044,17473,100,0004,105,00024,576
8Oct 19, 2026 17:239,36888,701,07373,386,0004,371,00024,576
9Oct 19, 2026 17:239,87392,836,24576,531,0005,421,00024,576