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 listSep 16, 2026 20:13Victor MerckléVictor MerckléScore: 36,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 20:1435,586305,233,204294,288,0001,078,0002,117,632stderr
2Sep 16, 2026 20:1435,675305,900,121295,029,0001,081,0002,117,632stderr
3Sep 16, 2026 20:1435,918308,020,084297,056,0001,067,0002,117,632stderr
4Sep 16, 2026 20:1435,949308,272,682297,273,0001,109,0002,117,632stderr
5Sep 16, 2026 20:1436,033308,871,715297,994,0001,082,0002,117,632stderr
6Sep 16, 2026 20:1436,333311,450,091300,434,0001,130,0002,117,632stderr
7Sep 16, 2026 20:1436,392315,357,689300,917,0001,141,0002,117,632stderr
8Sep 16, 2026 20:1436,485312,662,828301,733,0001,098,0002,117,632stderr
9Sep 16, 2026 20:1436,640314,012,980302,981,0001,138,0002,117,632stderr