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 31, 2026 13:01Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:54046,452,41637,156,0001,179,0002,117,632expected "74600294196621100 ", got "18248072388194092 "
2Jul 7, 2026 03:54053,868,87337,429,0001,243,0002,117,632expected "74600294196621100 ", got "18248072388194092 "
3Jul 7, 2026 03:54045,175,51036,024,0001,181,0002,117,632expected "74600294196621100 ", got "16569171140194092 "
4Mar 31, 2026 13:014,65171,288,44837,590,0001,015,0002,535,424
5Mar 31, 2026 13:015,00267,116,05640,506,0001,012,0002,535,424
6Mar 31, 2026 13:015,01168,002,12540,578,0001,014,0002,273,280