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 listMay 31, 2026 20:47Jora BabayanJora BabayanScore: 50,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2026 20:4750,212425,893,421415,756,0001,005,0002,113,536
2May 31, 2026 20:4750,227427,782,260415,888,0001,004,0002,113,536
3May 31, 2026 20:4750,252426,171,085416,089,0001,006,0002,113,536
4May 31, 2026 20:4750,261426,292,951416,168,0001,003,0002,113,536
5May 31, 2026 20:4750,269426,188,246416,231,0001,003,0002,113,536
6May 31, 2026 20:4750,283426,329,008416,347,0001,003,0002,113,536
7May 31, 2026 20:4750,288426,424,822416,392,0001,004,0002,113,536
8May 31, 2026 20:4750,289426,399,582416,395,0001,004,0002,113,536
9May 31, 2026 20:4750,300426,532,811416,488,0001,003,0002,113,536