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 listJun 1, 2026 13:52Jora BabayanJora BabayanScore: 57,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 13:5357,045482,478,943472,471,0001,004,0002,113,536
2Jun 1, 2026 13:5357,052482,391,523472,529,0001,005,0002,113,536
3Jun 1, 2026 13:5357,408485,535,957475,487,0001,005,0002,113,536
4Jun 1, 2026 13:5357,411485,475,810475,515,0001,004,0002,113,536
5Jun 1, 2026 13:5357,415485,527,960475,548,0001,003,0002,113,536
6Jun 1, 2026 13:5357,418485,571,325475,568,0001,003,0002,113,536
7Jun 1, 2026 13:5357,421485,573,720475,594,0001,005,0002,113,536
8Jun 1, 2026 13:5357,434485,788,890475,704,0001,006,0002,113,536
9Jun 1, 2026 13:5357,445485,797,536475,791,0001,004,0002,113,536