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 listDec 6, 2025 11:20Rajarshi BasuRajarshi BasuScore: 7,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:206,88579,941,00156,140,0001,002,0002,289,664
2Dec 6, 2025 11:206,88779,660,78055,156,0002,005,0002,289,664
3Dec 6, 2025 11:206,95182,414,53556,684,0001,012,0002,265,088
4Dec 6, 2025 11:207,09982,140,76856,925,0001,997,0002,273,280
5Dec 6, 2025 11:207,17990,721,76958,579,0001,009,0002,289,664
6Dec 6, 2025 11:207,24881,826,47158,151,0002,005,0002,281,472