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 7, 2026 09:43Mohammad Anas KhanMohammad Anas KhanScore: 2,024,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 09:432,020,22816,800,337,83316,719,910,00047,979,0002,277,376
2Mar 7, 2026 09:432,020,52816,801,082,10116,712,406,00057,977,0002,265,088
3Mar 7, 2026 09:432,020,65816,800,384,29416,700,494,00070,968,0002,260,992
4Mar 7, 2026 09:432,020,90516,805,124,03716,702,550,00070,964,0002,285,568
5Mar 7, 2026 09:432,024,55316,836,458,12616,739,818,00063,972,0002,285,568
6Mar 7, 2026 09:432,025,69116,847,272,81116,744,270,00068,968,0002,277,376
7Mar 7, 2026 09:432,027,59816,858,974,45616,760,090,00068,971,0002,277,376
8Mar 7, 2026 09:432,037,02016,936,518,01216,846,287,00060,975,0002,289,664
9Mar 7, 2026 09:432,065,56917,175,152,42217,081,255,00062,971,0002,277,376