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 30, 2026 23:17Josu San MartinJosu San MartinScore: 4,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:294,36044,620,02435,155,0001,033,0002,113,536
2Aug 30, 2026 23:294,36944,743,72335,238,0001,030,0002,113,536
3Aug 30, 2026 23:294,37244,800,08735,256,0001,034,0002,113,536
4Aug 30, 2026 23:294,37444,795,46035,180,0001,125,0002,113,536
5Aug 30, 2026 23:294,38644,834,91535,380,0001,031,0002,113,536
6Aug 30, 2026 23:294,39544,932,30335,364,0001,117,0002,113,536
7Aug 30, 2026 23:294,44345,354,37435,869,0001,011,0002,113,536
8Aug 30, 2026 23:294,45845,486,46435,963,0001,041,0002,113,536
9Aug 30, 2026 23:294,50545,827,74036,277,0001,117,0002,113,536