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 listNov 3, 2025 06:55vonqovonqoScore: 396,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 06:55392,6333,286,280,2793,184,902,00073,951,0002,289,664
2Nov 3, 2025 06:55392,8073,287,398,9283,176,339,00083,956,0002,281,472
3Nov 3, 2025 06:55392,8403,294,676,5133,194,600,00065,971,0002,281,472
4Nov 3, 2025 06:55393,0553,290,693,7793,210,385,00051,973,0002,289,664
5Nov 3, 2025 06:55396,3833,320,659,4683,211,031,00078,951,0002,281,472
6Nov 3, 2025 06:55402,1843,368,367,1923,257,176,00080,954,0002,281,472
7Nov 3, 2025 06:55403,5023,374,266,4893,270,114,00078,954,0002,289,664
8Nov 3, 2025 06:55404,2773,386,466,7413,274,534,00080,963,0002,281,472
9Nov 3, 2025 06:55407,6783,408,858,8833,327,764,00055,962,0002,281,472