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 19:52Victor MerckléVictor MerckléScore: 4,320Success
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 19:534,12142,594,15433,096,0001,112,0002,113,536
2Aug 26, 2026 19:534,12742,454,70033,135,0001,122,0002,113,536
3Aug 26, 2026 19:534,14442,758,71433,321,0001,080,0002,113,536
4Aug 26, 2026 19:534,17142,803,37333,467,0001,157,0002,113,536
5Aug 26, 2026 19:534,32044,062,49634,801,0001,055,0002,113,536
6Aug 26, 2026 19:534,38946,066,43335,322,0001,107,0002,113,536
7Aug 26, 2026 19:534,46445,358,54935,977,0001,075,0002,113,536
8Aug 26, 2026 19:534,48945,571,79036,171,0001,092,0002,113,536
9Aug 26, 2026 19:534,69347,229,70437,910,0001,050,0002,113,536