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 listNov 27, 2024 01:37Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:07Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:07042,389,76433,206,0001,022,0002,121,728expected "74600294196621100 ", got "72431780796084012 "stderr
2Jul 7, 2026 00:0709,184,87301,304,00020,480No answer to stdout. Died or killed?
3Nov 27, 2024 01:374,26060,476,72433,342,0002,020,0002,297,856
4Nov 27, 2024 01:374,29363,585,04334,618,0001,018,0002,289,664
5Nov 27, 2024 01:374,31858,719,29433,851,0001,991,0002,269,184
6Nov 27, 2024 01:374,33257,897,65232,959,0002,996,0002,535,424
7Nov 27, 2024 01:374,47962,010,22735,163,0002,009,0002,273,280
8Nov 27, 2024 01:374,77763,854,29639,651,00002,392,064