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 listNov 1, 2026 19:20Dinu GoyalDinu GoyalScore: 55,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:2055,869474,549,182461,612,0002,101,0002,125,824
2Nov 1, 2026 19:2055,874474,575,797461,655,0002,104,0002,125,824
3Nov 1, 2026 19:2055,887475,326,816461,866,0002,004,0002,125,824
4Nov 1, 2026 19:2055,898475,330,005461,949,0002,008,0002,125,824
5Nov 1, 2026 19:2055,902474,905,815461,985,0002,002,0002,125,824
6Nov 1, 2026 19:2055,904474,907,044461,908,0002,101,0002,125,824
7Nov 1, 2026 19:2055,907475,469,227463,023,0001,011,0002,125,824
8Nov 1, 2026 19:2055,911475,040,548462,056,0002,009,0002,125,824
9Nov 1, 2026 19:2055,926475,322,575462,089,0002,100,0002,125,824