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 16, 2026 17:46marko1597marko1597Score: 5,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 17:505,11250,841,17641,319,0001,115,0002,117,632
2Aug 16, 2026 17:505,12651,669,93841,431,0001,117,0002,117,632
3Aug 16, 2026 17:505,13651,743,50441,384,0001,252,0002,117,632
4Aug 16, 2026 17:505,14351,140,38541,570,0001,118,0002,117,632
5Aug 16, 2026 17:505,26052,832,43142,540,0001,118,0002,117,632
6Aug 16, 2026 17:506,26760,549,05750,872,0001,147,0002,117,632
7Aug 16, 2026 17:506,36761,962,19951,726,0001,123,0002,117,632
8Aug 16, 2026 17:506,77264,669,10855,090,0001,119,0002,117,632
9Aug 16, 2026 17:507,24069,324,80558,977,0001,117,0002,117,632