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 listApr 6, 2026 19:12Danylo MocherniukDanylo MocherniukScore: 5,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 19:125,72077,818,80445,459,0002,020,0002,297,856
2Apr 6, 2026 19:125,72269,992,89546,484,0001,010,0002,297,856
3Apr 6, 2026 19:125,72975,181,05145,524,0002,023,0002,289,664
4Apr 6, 2026 19:125,73073,832,11946,544,0001,011,0002,428,928
5Apr 6, 2026 19:125,73175,785,60947,571,00002,297,856
6Apr 6, 2026 19:125,73674,486,33446,596,0001,012,0002,297,856
7Apr 6, 2026 19:125,76782,097,03345,872,0001,994,0002,297,856
8Apr 6, 2026 19:125,77271,736,38245,913,0001,996,0002,297,856
9Apr 6, 2026 19:125,78374,177,65245,998,0001,999,0002,428,928