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 13, 2026 17:31Victor MerckléVictor MerckléScore: 369,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:32369,1023,073,744,7693,062,490,0001,059,0002,117,632stderr
2May 13, 2026 17:32369,2913,074,286,0393,064,045,0001,077,0002,117,632stderr
3May 13, 2026 17:32369,3303,075,104,6953,064,228,0001,218,0002,117,632stderr
4May 13, 2026 17:32369,5383,074,872,2013,066,003,0001,169,0002,117,632stderr
5May 13, 2026 17:32369,7323,076,117,3533,067,783,0001,000,0002,117,632stderr
6May 13, 2026 17:32369,7333,077,086,4023,067,638,0001,146,0002,117,632stderr
7May 13, 2026 17:32369,9793,081,211,2963,069,678,0001,155,0002,117,632stderr
8May 13, 2026 17:32371,2693,092,155,1213,080,500,0001,039,0002,117,632stderr
9May 13, 2026 17:32371,5373,092,407,9113,082,504,0001,254,0002,117,632stderr