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 21:56Victor MerckléVictor MerckléScore: 4,084Success
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 21:574,01141,863,90929,230,0004,062,00024,576stderr
2Sep 7, 2026 21:574,02742,000,92829,490,0003,937,00024,576stderr
3Sep 7, 2026 21:574,03842,601,46629,353,0004,168,00024,576stderr
4Sep 7, 2026 21:574,08343,105,56529,416,0004,481,00024,576stderr
5Sep 7, 2026 21:574,08443,124,69829,324,0004,574,00024,576stderr
6Sep 7, 2026 21:574,10242,411,55829,420,0004,630,0002,117,632stderr
7Sep 7, 2026 21:574,10943,323,48829,295,0004,813,0002,117,632stderr
8Sep 7, 2026 21:574,11042,387,70129,544,0004,575,0002,117,632stderr
9Sep 7, 2026 21:574,13442,839,70329,642,0004,675,00024,576stderr