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 15, 2026 11:43Daniel MastalerzDaniel MastalerzScore: 8,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 11:438,55293,211,59168,981,0001,999,0002,523,136
2Feb 15, 2026 11:438,55394,102,92567,988,0002,999,0002,306,048
3Feb 15, 2026 11:438,58094,345,63868,209,0003,009,0002,306,048