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 listAug 25, 2026 17:00Victor MerckléVictor MerckléScore: 26,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 17:0026,016224,327,332214,904,0001,030,0002,117,632stderr
2Aug 25, 2026 17:0026,560228,816,421219,294,0001,157,0002,117,632stderr
3Aug 25, 2026 17:0026,568228,904,414219,425,0001,096,0002,117,632stderr
4Aug 25, 2026 17:0026,579228,995,042219,603,0001,003,0002,117,632stderr
5Aug 25, 2026 17:0026,596230,421,752219,735,0001,015,0002,117,632stderr
6Aug 25, 2026 17:0026,597229,137,033219,616,0001,142,0002,117,632stderr
7Aug 25, 2026 17:0026,601229,902,924219,718,0001,073,0002,117,632stderr
8Aug 25, 2026 17:0026,601229,837,001219,756,0001,038,0002,117,632stderr
9Aug 25, 2026 17:0026,609229,355,351219,833,0001,026,0002,117,632stderr