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 5, 2026 06:24C21C21Score: 56,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 06:2556,895482,240,070471,229,0001,003,0002,113,536
2Aug 5, 2026 06:2556,900482,299,222471,273,0001,004,0002,113,536
3Aug 5, 2026 06:2556,904482,402,297471,303,0001,004,0002,113,536
4Aug 5, 2026 06:2556,905482,342,601471,310,0001,003,0002,113,536
5Aug 5, 2026 06:2556,907482,382,888471,327,0001,004,0002,113,536
6Aug 5, 2026 06:2556,914482,415,541471,384,0001,005,0002,113,536
7Aug 5, 2026 06:2556,922482,543,945471,454,0001,005,0002,113,536
8Aug 5, 2026 06:2556,923482,477,248471,457,0001,004,0002,113,536
9Aug 5, 2026 06:2556,930482,555,642471,518,0001,005,0002,113,536