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 16, 2026 17:47wnwnScore: 8,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 17:478,34398,199,75266,239,0003,010,0002,433,024
2Feb 16, 2026 17:478,40798,099,57165,787,0003,987,0002,383,872
3Feb 16, 2026 17:478,40994,049,14966,805,0002,991,0002,351,104
4Feb 16, 2026 17:478,42397,025,36766,916,0002,996,0002,379,776
5Feb 16, 2026 17:478,55293,311,17765,982,0004,998,0002,428,928
6Feb 16, 2026 17:478,57398,793,75168,151,0003,006,0002,404,352
7Feb 16, 2026 17:478,73896,740,52069,507,0003,022,0002,387,968
8Feb 16, 2026 17:478,81497,337,03869,150,0004,008,0002,408,448
9Feb 16, 2026 17:478,84696,661,33470,402,0003,017,0002,416,640