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 listDec 27, 2025 22:16Josu San MartinJosu San MartinScore: 31,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 22:1631,302282,289,702257,811,0001,998,0002,289,664
2Dec 27, 2025 22:1631,326288,336,570259,002,0001,000,0002,289,664
3Dec 27, 2025 22:1631,932287,386,185264,036,0001,000,0002,359,296
4Dec 27, 2025 22:1631,942287,895,090264,119,0001,000,0002,355,200
5Dec 27, 2025 22:1631,945290,223,281263,141,0002,001,0002,359,296
6Dec 27, 2025 22:1631,946298,672,328264,154,0001,000,0002,363,392
7Dec 27, 2025 22:1631,948289,254,013264,165,0001,000,0002,367,488
8Dec 27, 2025 22:1631,958288,804,665264,250,0001,000,0002,363,392
9Dec 27, 2025 22:1631,974293,178,668264,387,0001,001,0002,281,472