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 8, 2025 11:39luckyhwanluckyhwanScore: 53,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:3953,728472,837,163443,947,0001,999,0002,256,896
2Dec 8, 2025 11:3953,767469,778,385445,263,0001,000,0002,387,968
3Dec 8, 2025 11:3953,772470,929,757445,311,0001,000,0002,510,848
4Dec 8, 2025 11:3953,775473,510,028445,334,0001,000,0002,519,040
5Dec 8, 2025 11:3953,775467,780,455445,333,0001,000,0002,510,848
6Dec 8, 2025 11:3953,779471,659,703445,364,0001,000,0002,387,968
7Dec 8, 2025 11:3953,794473,257,894445,486,0001,001,0002,387,968
8Dec 8, 2025 11:3953,798475,223,915444,527,0001,997,0002,387,968
9Dec 8, 2025 11:3953,805470,253,055446,580,00002,256,896