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: 25,396Success
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:2724,763232,307,946204,533,0001,002,0002,269,184
2Mar 14, 2026 22:2725,391242,972,248207,753,0002,996,0002,265,088
3Mar 14, 2026 22:2725,395233,119,842208,781,0001,997,0002,269,184
4Mar 14, 2026 22:2725,396234,690,721209,789,000998,0002,269,184
5Mar 14, 2026 22:2725,396238,722,346208,786,0001,997,0002,506,752
6Mar 14, 2026 22:2725,396235,915,139208,791,0001,998,0002,269,184
7Mar 14, 2026 22:2725,396236,227,446209,791,000999,0002,265,088
8Mar 14, 2026 22:2725,397234,361,126208,800,0001,998,0002,392,064
9Mar 14, 2026 22:2725,406244,086,887208,874,0001,998,0002,265,088