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 14:14Rajarshi BasuRajarshi BasuScore: 8,811Success
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 14:148,56297,193,84770,063,0001,000,0002,289,664
2Dec 6, 2025 14:148,57297,223,80769,142,0002,004,0002,281,472
3Dec 6, 2025 14:148,574100,636,88569,163,0002,004,0002,289,664
4Dec 6, 2025 14:148,81198,555,28371,132,0002,003,0002,289,664
5Dec 6, 2025 14:148,82198,009,06272,215,0001,002,0002,289,664
6Dec 6, 2025 14:148,925102,091,99774,076,00002,265,088