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 listAug 25, 2026 11:53Victor MerckléVictor MerckléScore: 4,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 11:543,96941,346,90431,837,0001,112,0002,117,632stderr
2Aug 25, 2026 11:543,97841,475,23931,904,0001,120,0002,117,632stderr
3Aug 25, 2026 11:543,98041,452,39631,921,0001,121,0002,117,632stderr
4Aug 25, 2026 11:544,01342,848,24732,156,0001,160,0002,117,632stderr
5Aug 25, 2026 11:544,07742,239,06432,727,0001,118,0002,117,632stderr
6Aug 25, 2026 11:544,09742,457,55032,965,0001,042,0002,117,632stderr
7Aug 25, 2026 11:544,09942,388,56532,939,0001,084,0002,117,632stderr
8Aug 25, 2026 11:544,29444,017,27434,546,0001,099,0002,117,632stderr
9Aug 25, 2026 11:544,43145,190,64835,629,0001,149,0002,117,632stderr