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 12, 2026 00:01Victor MerckléVictor MerckléScore: 5,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 00:025,55954,499,89945,113,0001,027,0002,117,632stderr
2Aug 12, 2026 00:025,56354,613,91045,031,0001,148,0002,117,632stderr
3Aug 12, 2026 00:025,58155,278,88145,218,0001,111,0002,117,632stderr
4Aug 12, 2026 00:025,59054,783,39445,380,0001,017,0002,117,632stderr
5Aug 12, 2026 00:025,61054,936,61745,540,0001,027,0002,117,632stderr
6Aug 12, 2026 00:025,62955,830,59545,618,0001,108,0002,117,632stderr
7Aug 12, 2026 00:025,63955,224,05645,589,0001,219,0002,117,632stderr
8Aug 12, 2026 00:025,85657,059,02647,588,0001,022,0002,117,632stderr
9Aug 12, 2026 00:025,86257,037,33347,642,0001,015,0002,117,632stderr