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 1, 2026 20:52leoweleoweScore: 68,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:5268,435592,981,438506,009,00062,001,0002,273,280
2Apr 1, 2026 20:5268,469594,820,442509,365,00058,926,0002,281,472
3Apr 1, 2026 20:5268,531592,294,209506,828,00061,979,0002,289,664