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 listJul 6, 2026 04:29Teow Hua JunTeow Hua JunScore: 72,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:3072,090608,130,386587,637,00010,711,0002,117,632stderr
2Jul 6, 2026 04:3072,140608,934,470588,425,00010,341,0002,117,632stderr
3Jul 6, 2026 04:3072,167608,570,749588,317,00010,674,0002,117,632stderr
4Jul 6, 2026 04:3072,250609,773,527588,539,00011,142,0002,117,632stderr
5Jul 6, 2026 04:3072,258609,817,323588,650,00011,092,0002,117,632stderr
6Jul 6, 2026 04:3072,316609,971,262589,126,00011,102,0002,117,632stderr
7Jul 6, 2026 04:3072,332610,459,384589,288,00011,070,0002,117,632stderr
8Jul 6, 2026 04:3072,343610,718,291589,292,00011,158,0002,117,632stderr
9Jul 6, 2026 04:3072,382610,340,344590,376,00010,395,0002,117,632stderr