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 listDec 15, 2025 12:50AndreiAndreiScore: 76,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 12:5076,018657,255,760587,953,00042,996,0002,535,424
2Dec 15, 2025 12:5076,037654,423,470582,100,00049,008,0002,293,760
3Dec 15, 2025 12:5076,045657,143,129579,160,00052,014,0002,293,760
4Dec 15, 2025 12:5076,049659,972,152581,194,00050,016,0002,510,848
5Dec 15, 2025 12:5076,060661,882,396572,269,00059,027,0002,297,856
6Dec 15, 2025 12:5076,122658,272,387581,826,00049,985,0002,293,760
7Dec 15, 2025 12:5076,135658,947,346575,927,00055,992,0002,289,664
8Dec 15, 2025 12:5076,148657,239,223577,029,00055,002,0002,293,760
9Dec 15, 2025 12:5076,264660,766,874579,991,00052,999,0002,531,328