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 26, 2026 23:37Ondřej PolaneckýOndřej PolaneckýScore: 17,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:3717,556170,661,184143,718,0001,996,0002,281,472
2Mar 26, 2026 23:3717,639177,670,828145,398,0001,002,0002,281,472
3Mar 26, 2026 23:3717,751168,369,218144,326,0003,006,0002,281,472