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 listJul 28, 2025 01:52Marco BarboneMarco BarboneScore: 125,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 01:52125,6331,067,548,9911,041,751,000999,0002,519,040
2Jul 28, 2025 01:52125,6841,062,873,4421,039,183,0003,996,0002,519,040
3Jul 28, 2025 01:52125,7661,067,191,8931,040,861,0002,999,0002,273,280