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 19:24wnwnScore: 8,494Success
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 19:338,34592,706,05366,255,0003,011,0002,420,736
2Feb 16, 2026 19:338,34794,239,04666,267,0003,012,0002,428,928
3Feb 16, 2026 19:338,35596,759,40564,325,0005,025,0002,449,408
4Feb 16, 2026 19:338,38896,763,10066,592,0003,026,0002,375,680
5Feb 16, 2026 19:338,49499,060,23367,525,0002,979,0002,428,928
6Feb 16, 2026 19:338,52394,044,76666,699,0004,042,0002,445,312
7Feb 16, 2026 19:338,52697,219,78568,770,0001,993,0002,265,088
8Feb 16, 2026 19:338,54494,136,76267,919,0002,996,0002,383,872
9Feb 16, 2026 19:338,60394,345,10070,402,0001,005,0002,514,944