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 14, 2026 22:27Ondřej PolaneckýOndřej PolaneckýScore: 24,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:2723,884223,301,143196,237,0002,002,0002,277,376
2Mar 14, 2026 22:2724,042229,197,731197,544,0002,005,0002,367,488
3Mar 14, 2026 22:2724,172228,661,731198,618,0002,006,0002,277,376
4Mar 14, 2026 22:2724,212223,577,171198,960,0001,999,0002,277,376
5Mar 14, 2026 22:2724,213225,616,463198,970,0001,999,0002,277,376
6Mar 14, 2026 22:2724,216224,342,754199,992,000999,0002,273,280
7Mar 14, 2026 22:2724,391229,468,293202,445,00002,277,376
8Mar 14, 2026 22:2724,398230,422,578200,496,0002,004,0002,277,376
9Mar 14, 2026 22:2724,421226,045,088200,696,0001,996,0002,277,376