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 listJul 12, 2026 16:07Kevin HeaveyKevin HeaveyScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 16:143,87641,994,60431,149,0001,024,0002,117,632
2Jul 12, 2026 16:143,87741,738,51330,962,0001,220,0002,117,632
3Jul 12, 2026 16:143,88341,771,04931,210,0001,020,0002,117,632
4Jul 12, 2026 16:143,88641,794,68931,234,0001,021,0002,117,632
5Jul 12, 2026 16:143,88741,791,76131,248,0001,022,0002,117,632
6Jul 12, 2026 16:143,88941,897,77831,259,0001,023,0002,117,632
7Jul 12, 2026 16:143,89441,887,80931,277,0001,046,0002,117,632
8Jul 12, 2026 16:143,90842,035,04731,237,0001,205,0002,117,632
9Jul 12, 2026 16:143,93042,234,99231,594,0001,030,0002,117,632