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 listDec 11, 2025 17:19Bernard TeoBernard TeoScore: 6,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 17:196,50676,796,30153,003,0001,000,0002,273,280
2Dec 11, 2025 17:196,51580,997,87853,073,0001,001,0002,273,280
3Dec 11, 2025 17:196,51676,840,78953,084,0001,001,0002,273,280
4Dec 11, 2025 17:196,51877,948,52452,100,0002,003,0002,396,160
5Dec 11, 2025 17:196,52175,811,20552,118,0002,004,0002,408,448
6Dec 11, 2025 17:196,52577,155,95352,154,0002,005,0002,273,280