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 listMay 14, 2026 08:36Victor MerckléVictor MerckléScore: 66,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:3665,023546,936,629538,672,0001,026,0002,117,632stderr
2May 14, 2026 08:3665,129548,838,112539,524,0001,047,0002,117,632stderr
3May 14, 2026 08:3665,176549,032,062539,844,0001,125,0002,117,632stderr
4May 14, 2026 08:3665,192548,990,248540,010,0001,085,0002,117,632stderr
5May 14, 2026 08:3666,308559,904,201549,114,0001,249,0002,117,632stderr
6May 14, 2026 08:3666,319558,845,078549,355,0001,098,0002,117,632stderr
7May 14, 2026 08:3666,390558,371,724550,030,0001,014,0002,117,632stderr
8May 14, 2026 08:3666,408560,809,301550,025,0001,169,0002,117,632stderr
9May 14, 2026 08:3666,419560,289,680550,100,0001,178,0002,117,632stderr