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 listApr 21, 2026 18:13Mohamed Elmahdi BendimeradMohamed Elmahdi BendimeradScore: 2,068,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:142,068,27617,193,663,51517,107,722,00058,974,0002,318,336
2Apr 21, 2026 18:142,068,39217,192,074,13417,102,686,00064,972,0002,318,336
3Apr 21, 2026 18:142,071,58717,222,899,42517,122,216,00071,963,0002,318,336