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 11, 2025 03:28Marco BarboneMarco BarboneScore: 33,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:2833,791306,794,458280,462,00002,269,184
2Oct 11, 2025 03:2833,795306,796,164280,500,00002,269,184
3Oct 11, 2025 03:2833,796312,572,359279,507,0001,001,0002,273,280
4Oct 11, 2025 03:2833,796308,059,686279,502,0001,001,0002,273,280
5Oct 11, 2025 03:2833,805304,342,946278,583,0001,997,0002,289,664
6Oct 11, 2025 03:2833,811312,838,539279,636,000998,0002,289,664
7Oct 11, 2025 03:2833,816307,604,714278,675,0001,997,0002,273,280
8Oct 11, 2025 03:2833,817307,772,495278,688,0001,997,0002,289,664
9Oct 11, 2025 03:2833,820303,571,589278,707,0001,997,0002,527,232