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 20:52Victor MerckléVictor MerckléScore: 35,319Success
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 20:5335,110300,587,623287,483,0003,933,00024,576stderr
2Sep 7, 2026 20:5335,110301,367,274287,099,0004,322,00024,576stderr
3Sep 7, 2026 20:5335,118300,242,447287,044,0004,437,00024,576stderr
4Sep 7, 2026 20:5335,140300,406,105287,347,0004,323,00024,576stderr
5Sep 7, 2026 20:5335,319301,818,649289,030,0004,123,00024,576stderr
6Sep 7, 2026 20:5335,357302,099,851289,261,0004,209,00024,576stderr
7Sep 7, 2026 20:5335,405303,128,276289,509,0004,358,00024,576stderr
8Sep 7, 2026 20:5335,425303,250,505289,518,0004,514,00024,576stderr
9Sep 7, 2026 20:5335,501303,825,823290,250,0004,409,00024,576stderr