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 listAug 2, 2025 20:35Jack FrigaardJack FrigaardScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:354,67863,917,84135,843,0002,986,0002,453,504
2Aug 2, 2025 20:354,68664,125,34735,900,0002,991,0002,510,848
3Aug 2, 2025 20:354,70364,042,35536,036,0003,003,0002,449,408
4Aug 2, 2025 20:354,76160,551,20738,501,0001,013,0002,519,040
5Aug 2, 2025 20:354,77065,249,03438,572,0001,015,0002,453,504
6Aug 2, 2025 20:354,79567,719,52036,815,0002,985,0002,519,040