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 19, 2026 22:54Mikołaj UzarskiMikołaj UzarskiScore: 5,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:565,89278,542,23541,915,0006,985,0002,297,856
2Feb 19, 2026 22:565,92577,097,10643,159,0006,022,0002,310,144
3Feb 19, 2026 22:566,01770,544,42541,952,0007,991,0002,473,984