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:25Ondřej PolaneckýOndřej PolaneckýScore: 17,320Success
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:2517,290168,699,744142,504,0001,003,0002,281,472
2Mar 28, 2026 20:2517,320176,547,194143,755,00002,281,472
3Mar 28, 2026 20:2517,325167,377,179141,800,0001,997,0002,281,472