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 listOct 17, 2026 12:22timothygktimothygkScore: 44,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:2244,536380,449,509368,649,0001,001,0002,113,536
2Oct 17, 2026 12:2244,544380,680,962368,718,0001,001,0002,113,536
3Oct 17, 2026 12:2244,576380,791,507368,982,0001,006,0002,113,536
4Oct 17, 2026 12:2244,580380,810,579369,014,0001,006,0002,113,536
5Oct 17, 2026 12:2244,596380,949,647369,150,0001,004,0002,113,536
6Oct 17, 2026 12:2244,785382,414,737370,718,0001,001,0002,113,536
7Oct 17, 2026 12:2244,877383,382,144371,481,0001,001,0002,113,536
8Oct 17, 2026 12:2244,954383,871,363372,118,0001,002,0002,113,536
9Oct 17, 2026 12:2245,006384,256,835372,554,0001,001,0002,113,536