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 28, 2026 01:35olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:42048,147,66237,528,0001,024,0002,117,632expected "74600294196621100 ", got "53554964798705452 "
2Jul 7, 2026 05:42047,261,83436,697,0001,023,0002,117,632expected "74600294196621100 ", got "53518395483233836 "
3Jul 7, 2026 05:42047,938,55337,274,0001,027,0002,117,632expected "74600294196621100 ", got "53513762255292972 "
4Mar 28, 2026 01:355,71770,462,63446,440,0001,009,0002,469,888
5Mar 28, 2026 01:355,76773,380,34144,872,0002,991,0002,387,968
6Mar 28, 2026 01:355,80278,949,90546,148,0002,006,0002,375,680