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 listAug 26, 2026 20:00Victor MerckléVictor MerckléScore: 3,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:003,78039,824,89830,235,0001,144,0002,113,536
2Aug 26, 2026 20:003,78339,917,16930,275,0001,128,0002,113,536
3Aug 26, 2026 20:003,78740,364,31230,324,0001,115,0002,113,536
4Aug 26, 2026 20:003,79839,838,39430,280,0001,245,0002,113,536
5Aug 26, 2026 20:003,83739,986,91430,798,0001,055,0002,113,536
6Aug 26, 2026 20:003,84040,112,79230,828,0001,047,0002,113,536
7Aug 26, 2026 20:003,85841,196,21630,893,0001,131,0002,113,536
8Aug 26, 2026 20:003,88341,262,39431,201,0001,030,0002,113,536
9Aug 26, 2026 20:003,96541,297,20831,864,0001,051,0002,113,536