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 19:56Ondřej PolaneckýOndřej PolaneckýScore: 37,484Success
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 19:5637,428338,342,569308,659,0001,997,0002,269,184
2Mar 28, 2026 19:5637,484332,886,300311,115,00002,277,376
3Mar 28, 2026 19:5637,540338,088,739310,585,000998,0002,265,088