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 19:08Mikołaj UzarskiMikołaj UzarskiScore: 5,824Success
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 19:105,72269,296,82040,417,0007,073,0002,408,448
2Feb 18, 2026 19:105,79173,312,32143,058,0005,006,0002,428,928
3Feb 18, 2026 19:105,80471,925,97441,148,0007,025,0002,392,064
4Feb 18, 2026 19:105,80670,571,22945,176,0003,011,0002,461,696
5Feb 18, 2026 19:105,82474,969,81141,291,0007,049,0002,404,352
6Feb 18, 2026 19:105,84069,702,11042,413,0006,059,0002,494,464
7Feb 18, 2026 19:105,84174,119,26344,443,0004,040,0002,396,160
8Feb 18, 2026 19:105,87275,274,24941,628,0007,107,0002,502,656
9Feb 18, 2026 19:105,92180,142,06745,131,0004,011,0002,453,504