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 listMar 4, 2026 22:19olliecrowolliecrowScore: 5,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:195,55072,491,77042,060,0004,005,0002,428,928
2Mar 4, 2026 22:195,58073,671,78644,299,0002,013,0002,482,176
3Mar 4, 2026 22:195,61174,643,98242,523,0004,049,0002,441,216
4Mar 4, 2026 22:195,86076,252,19644,587,0004,053,0002,416,640
5Mar 4, 2026 22:195,86174,548,50845,605,0003,040,0002,478,080
6Mar 4, 2026 22:195,93381,023,96245,228,0004,020,0002,318,336
7Mar 4, 2026 22:195,96876,316,93646,499,0003,032,0002,326,528
8Mar 4, 2026 22:195,97877,757,44745,569,0004,050,0002,510,848
9Mar 4, 2026 22:195,98681,941,89046,705,0002,981,0002,457,600
10Mar 4, 2026 22:196,00383,493,64646,837,0002,989,0002,449,408
11Mar 4, 2026 22:196,01178,284,42045,903,0003,991,0002,359,296
12Mar 4, 2026 22:196,14283,881,04946,983,0003,998,0002,359,296