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 listFeb 18, 2026 23:19Mikołaj UzarskiMikołaj UzarskiScore: 5,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:195,70374,695,39043,310,0004,028,0002,396,160
2Feb 18, 2026 23:205,79368,923,64943,076,0005,008,0002,371,584
3Feb 18, 2026 23:195,81874,506,06044,267,0004,024,0002,396,160
4Feb 18, 2026 23:205,88375,665,49440,858,0007,972,0002,371,584
5Feb 18, 2026 23:205,88773,979,81143,880,0004,986,0002,457,600
6Feb 18, 2026 23:195,95672,052,37743,385,0006,053,0002,437,120