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 listNov 24, 2025 13:00Jeffrey JianJeffrey JianScore: 102,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 13:00102,214872,919,410792,415,00055,958,0002,482,176
2Nov 24, 2025 13:00102,327880,688,099790,359,00058,952,0002,379,776
3Nov 24, 2025 13:00102,352876,393,258792,551,00056,967,0002,478,080