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 6, 2025 10:05E SequeiraE SequeiraScore: 111,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:05111,597955,287,373872,299,00053,956,0002,322,432
2Feb 6, 2025 10:05111,626954,085,609869,526,00056,968,0002,473,984
3Feb 6, 2025 10:05111,680947,772,367861,951,00064,996,0002,334,720
4Feb 6, 2025 10:05111,692955,877,329854,041,00073,003,0002,482,176
5Feb 6, 2025 10:05111,767947,028,993866,689,00060,978,0002,347,008
6Feb 6, 2025 10:05111,849953,645,389870,387,00057,959,0002,473,984