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 listMar 26, 2026 06:03poyo180605poyo180605Score: 61,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 06:0361,001532,283,917433,267,00073,045,0002,289,664
2Mar 26, 2026 06:0361,033529,395,516442,626,00063,946,0002,494,464
3Mar 26, 2026 06:0361,039534,532,225451,662,00054,958,0002,490,368
4Mar 26, 2026 06:0361,095530,492,985433,076,00074,012,0002,285,568
5Mar 26, 2026 06:0361,126536,165,352427,293,00080,054,0002,293,760
6Mar 26, 2026 06:0361,141538,560,766438,408,00069,064,0002,293,760
7Mar 26, 2026 06:0361,159534,277,445433,678,00073,945,0002,293,760
8Mar 26, 2026 06:0361,239530,659,542443,373,00064,908,0002,293,760
9Mar 26, 2026 06:0361,293532,128,625455,760,00052,972,0002,490,368