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 12, 2026 08:34Victor MerckléVictor MerckléScore: 3,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 08:353,93341,057,78431,548,0001,103,0002,117,632stderr
2Aug 12, 2026 08:353,96741,192,23031,798,0001,133,0002,117,632stderr
3Aug 12, 2026 08:353,96941,120,47231,798,0001,150,0002,117,632stderr
4Aug 12, 2026 08:353,97741,223,24331,922,0001,089,0002,117,632stderr
5Aug 12, 2026 08:353,98142,091,23931,921,0001,128,0002,117,632stderr
6Aug 12, 2026 08:353,99041,483,92231,986,0001,139,0002,117,632stderr
7Aug 12, 2026 08:354,00141,388,06132,095,0001,116,0002,117,632stderr
8Aug 12, 2026 08:354,05642,117,69832,607,0001,061,0002,117,632stderr
9Aug 12, 2026 08:354,35445,219,72735,045,0001,097,0002,117,632stderr