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 29, 2026 08:28Victor MerckléVictor MerckléScore: 12,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:3012,020107,534,67798,704,0001,070,0002,113,536
2Jun 29, 2026 08:3012,023107,478,77498,793,0001,003,0002,113,536
3Jun 29, 2026 08:3012,024107,709,14698,736,0001,067,0002,113,536
4Jun 29, 2026 08:3012,024107,552,70498,722,0001,085,0002,113,536
5Jun 29, 2026 08:3012,034107,660,60698,887,0001,003,0002,113,536
6Jun 29, 2026 08:3012,045109,263,27598,938,0001,037,0002,113,536
7Jun 29, 2026 08:3012,054107,843,30599,047,0001,005,0002,113,536
8Jun 29, 2026 08:3012,056107,728,92699,061,0001,009,0002,113,536
9Jun 29, 2026 08:3012,062107,904,95099,114,0001,007,0002,113,536