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 19, 2026 05:23Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:24Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:24043,152,63634,099,0001,121,0002,117,632expected "74600294196621100 ", got "74211447267176236 "
2Jul 7, 2026 01:24042,896,00933,922,0001,093,0002,117,632expected "74600294196621100 ", got "74211447267176236 "
3Jul 7, 2026 01:24042,600,23733,298,0001,207,0002,117,632expected "74600294196621100 ", got "74211447267176236 "
4Apr 19, 2026 05:234,38363,670,74534,356,0002,020,0002,465,792
5Apr 19, 2026 05:234,38856,872,33135,411,0001,011,0002,469,888
6Apr 19, 2026 05:234,40056,613,02236,519,00002,535,424