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 listApr 13, 2026 18:33Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:10042,117,47033,081,0001,137,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
2Jul 7, 2026 00:10042,271,71333,101,0001,095,0002,117,632expected "74600294196621100 ", got "15157030540197920 "
3Jul 7, 2026 00:10042,404,75333,175,0001,115,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
4Apr 13, 2026 18:334,33764,513,52633,994,0001,999,0002,535,424
5Apr 13, 2026 18:334,34160,425,66434,033,0002,001,0002,535,424
6Apr 13, 2026 18:334,35462,031,41834,131,0002,007,0002,535,424