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 15, 2026 20:28Tomislav TunkovicTomislav TunkovicScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 20:294,28744,030,02835,583,000020,480
2Aug 15, 2026 20:294,29444,084,35335,645,000020,480
3Aug 15, 2026 20:294,29444,074,95935,647,000020,480
4Aug 15, 2026 20:294,29644,076,78435,662,000020,480
5Aug 15, 2026 20:294,29744,791,13735,671,000020,480
6Aug 15, 2026 20:294,30544,679,22335,739,000020,480
7Aug 15, 2026 20:294,31844,274,99335,847,000020,480
8Aug 15, 2026 20:294,32545,536,60435,898,000020,480
9Aug 15, 2026 20:294,32544,333,66035,903,000020,480