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 09:52wnwnScore: 7,304Success
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 09:527,19884,088,38056,754,0002,987,0002,375,680
2Feb 18, 2026 09:527,20591,173,59957,805,0001,993,0002,437,120
3Feb 18, 2026 09:527,23881,091,94357,069,0003,003,0002,461,696
4Feb 18, 2026 09:527,25788,689,18858,227,0002,007,0002,416,640
5Feb 18, 2026 09:527,30493,031,54658,602,0002,020,0002,314,240
6Feb 18, 2026 09:527,32498,877,91357,803,0002,989,0002,510,848
7Feb 18, 2026 09:527,49992,103,54360,238,0002,007,0002,494,464
8Feb 18, 2026 09:527,52885,731,24759,461,0003,023,0002,510,848
9Feb 18, 2026 09:527,65788,531,65460,525,0003,026,0002,514,944