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 24, 2026 01:13Ondřej PolaneckýOndřej PolaneckýScore: 8,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 01:138,44494,151,76968,081,0002,002,0002,396,160
2Mar 24, 2026 01:138,44895,799,68168,113,0002,003,0002,281,472
3Mar 24, 2026 01:138,46896,108,09769,278,0001,004,0002,404,352