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 2, 2026 12:32Priyansh RathiPriyansh RathiScore: 42,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 12:3242,214376,440,991349,374,0001,001,0002,375,680
2Mar 2, 2026 12:3242,562381,349,391351,264,0002,001,0002,539,520
3Mar 2, 2026 12:3242,689384,939,238353,319,0001,000,0002,539,520
4Mar 2, 2026 12:3242,742384,917,495352,763,0001,998,0002,396,160
5Mar 2, 2026 12:3242,747380,605,860353,803,000999,0002,535,424
6Mar 2, 2026 12:3242,748386,748,135352,811,0001,998,0002,396,160
7Mar 2, 2026 12:3242,786389,377,771354,125,0001,000,0002,531,328
8Mar 2, 2026 12:3242,845385,019,142353,613,0001,997,0002,359,296
9Mar 2, 2026 12:3243,106386,520,010353,785,0003,997,0002,396,160