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 26, 2026 08:06Victor MerckléVictor MerckléScore: 5,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:074,94848,849,08139,980,0001,094,0002,113,536
2Jun 26, 2026 08:074,97849,040,98640,306,0001,019,0002,113,536
3Jun 26, 2026 08:074,99049,070,67940,393,0001,030,0002,113,536
4Jun 26, 2026 08:074,99549,556,87240,337,0001,129,0002,113,536
5Jun 26, 2026 08:075,00149,238,86940,441,0001,070,0002,113,536
6Jun 26, 2026 08:075,00149,216,10940,506,0001,008,0002,113,536
7Jun 26, 2026 08:075,00850,478,99740,461,0001,112,0002,113,536
8Jun 26, 2026 08:075,04449,572,20440,710,0001,161,0002,113,536
9Jun 26, 2026 08:075,07850,327,29041,068,0001,086,0002,113,536