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 listMay 23, 2026 22:42Maya RebholzMaya RebholzScore: 8,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:438,23779,626,16163,193,0005,181,0002,113,536
2May 23, 2026 22:438,25180,886,21263,265,0005,221,0002,117,632
3May 23, 2026 22:438,27379,760,84463,231,0005,440,0002,117,632
4May 23, 2026 22:438,29279,951,68363,532,0005,295,0002,117,632
5May 23, 2026 22:438,30480,302,59763,407,0005,523,0002,113,536
6May 23, 2026 22:438,33379,506,23063,579,0005,593,0002,113,536
7May 23, 2026 22:438,34579,425,11963,631,0005,639,0002,117,632
8May 23, 2026 22:438,36180,648,96963,400,0006,004,0002,117,632
9May 23, 2026 22:438,37379,852,12763,731,0005,766,0002,117,632