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 2, 2026 23:22olliecrowolliecrowScore: 6,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 23:225,76773,021,97638,889,0008,974,0002,310,144
2Feb 2, 2026 23:225,81170,952,76744,213,0004,019,0002,502,656
3Feb 2, 2026 23:225,83871,217,62043,405,0005,047,0002,445,312
4Feb 2, 2026 23:226,31984,239,47844,377,0008,068,0002,342,912
5Feb 2, 2026 23:226,37283,911,47146,901,0005,987,0002,347,008
6Feb 2, 2026 23:226,38480,085,65948,992,0003,999,0002,502,656