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 12:31Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:58043,802,85534,676,0001,142,0002,117,632expected "74600294196621100 ", got "74228195355242284 "
2Jul 7, 2026 02:584,29145,101,32434,477,0001,142,0002,117,632
3Jul 7, 2026 02:584,34644,018,26934,958,0001,115,0002,117,632
4Mar 31, 2026 12:314,53464,983,66936,619,0001,017,0002,535,424
5Mar 31, 2026 12:314,66164,283,95737,667,0001,018,0002,273,280
6Mar 31, 2026 12:314,67867,332,99838,831,00002,535,424