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 listSep 25, 2025 10:00Wookyung JeongWookyung JeongScore: 64,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 09:5564,199559,178,806473,865,00058,983,0002,273,280
2Sep 25, 2025 09:5564,199554,627,457468,869,00063,982,0002,379,776
3Sep 25, 2025 09:5564,327556,119,920473,923,00059,990,0002,273,280
4Sep 25, 2025 10:0064,390561,517,203471,501,00062,933,0002,383,872
5Sep 25, 2025 10:0064,483563,473,727473,303,00061,908,0002,273,280
6Sep 25, 2025 10:0064,540559,714,750473,719,00061,963,0002,273,280