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 listJan 15, 2026 16:41Jonathan GopelJonathan GopelScore: 372,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 16:41368,3063,090,395,2832,996,959,00059,979,0002,281,472
2Jan 15, 2026 16:41368,3403,088,306,3962,984,269,00072,957,0002,289,664
3Jan 15, 2026 16:41371,8133,114,327,1173,022,070,00063,980,0002,289,664
4Jan 15, 2026 16:41371,8473,117,245,0983,025,363,00060,967,0002,281,472
5Jan 15, 2026 16:41372,5603,114,450,0213,029,281,00062,964,0002,281,472
6Jan 15, 2026 16:41372,8643,119,089,7283,035,793,00058,976,0002,355,200
7Jan 15, 2026 16:41374,1043,133,506,2963,051,084,00053,983,0002,281,472
8Jan 15, 2026 16:41376,3063,152,069,2473,064,356,00058,987,0002,289,664
9Jan 15, 2026 16:41381,3073,189,798,2013,104,871,00059,978,0002,289,664