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 18, 2026 10:21wnwnScore: 7,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:216,32876,619,30546,464,0006,060,0002,260,992
2Feb 18, 2026 10:216,45086,269,07649,495,0004,040,0002,338,816
3Feb 18, 2026 10:216,47482,626,54348,756,0004,975,0002,400,256
4Feb 18, 2026 10:217,22289,086,42455,948,0003,996,0002,416,640
5Feb 18, 2026 10:217,44688,142,25757,811,0003,987,0002,277,376
6Feb 18, 2026 10:217,44790,011,51558,823,0002,991,0002,510,848