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 7, 2026 17:12Victor MerckléVictor MerckléScore: 14,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:1314,280126,991,222112,503,0006,028,00024,576stderr
2Sep 7, 2026 17:1314,296127,178,994112,733,0005,926,00024,576stderr
3Sep 7, 2026 17:1314,307127,899,345112,130,0006,626,0002,117,632stderr
4Sep 7, 2026 17:1314,385128,606,094112,825,0006,572,0002,117,632stderr
5Sep 7, 2026 17:1314,545129,233,386114,599,0006,130,00024,576stderr
6Sep 7, 2026 17:1314,561130,117,299114,306,0006,552,0002,117,632stderr
7Sep 7, 2026 17:1314,601129,716,950114,919,0006,272,00024,576stderr
8Sep 7, 2026 17:1314,606129,764,470114,903,0006,329,00024,576stderr
9Sep 7, 2026 17:1314,675130,278,424115,548,0006,257,00024,576stderr