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 28, 2026 20:37Victor MerckléVictor MerckléScore: 4,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:374,72948,273,54338,229,0001,022,0002,113,536
2Aug 28, 2026 20:374,73548,343,79538,269,0001,035,0002,113,536
3Aug 28, 2026 20:374,74548,359,13738,367,0001,021,0002,113,536
4Aug 28, 2026 20:374,74648,466,30338,377,0001,019,0002,113,536
5Aug 28, 2026 20:374,74748,695,82238,385,0001,023,0002,113,536
6Aug 28, 2026 20:374,75848,454,06838,448,0001,047,0002,113,536
7Aug 28, 2026 20:374,75849,330,93538,472,0001,021,0002,113,536
8Aug 28, 2026 20:374,77048,662,91138,574,0001,020,0002,113,536
9Aug 28, 2026 20:374,81649,025,70538,944,0001,034,0002,113,536