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 22, 2025 19:04Mark R BestMark R BestScore: 58,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:0458,827512,393,599418,228,00070,038,0002,306,048
2Dec 22, 2025 19:0458,894520,436,034427,841,00060,977,0002,289,664
3Dec 22, 2025 19:0458,921516,606,110430,042,00059,005,0002,293,760
4Dec 22, 2025 19:0458,934510,661,743434,133,00055,016,0002,289,664
5Dec 22, 2025 19:0458,957513,627,356432,302,00057,039,0002,281,472
6Dec 22, 2025 19:0458,974514,723,659435,433,00054,053,0002,289,664
7Dec 22, 2025 19:0458,995516,411,662430,699,00058,958,0002,289,664
8Dec 22, 2025 19:0459,043513,879,194437,053,00053,006,0002,297,856
9Dec 22, 2025 19:0459,044517,866,779437,057,00053,006,0002,289,664