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 2, 2025 16:33triscacezar-droidtriscacezar-droidScore: 69,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 16:3369,660605,079,743522,158,00056,017,0002,273,280
2Nov 2, 2025 16:3369,672610,826,274521,247,00057,027,0002,285,568
3Nov 2, 2025 16:3369,693604,553,826513,398,00065,050,0002,273,280
4Nov 2, 2025 16:3369,705602,138,253522,596,00055,956,0002,273,280
5Nov 2, 2025 16:3369,711603,223,745524,548,00054,056,0002,273,280
6Nov 2, 2025 16:3369,757605,779,701523,985,00054,998,0002,273,280
7Nov 2, 2025 16:3369,760600,373,752523,008,00056,000,0002,273,280
8Nov 2, 2025 16:3369,761599,229,186527,013,00052,001,0002,273,280
9Nov 2, 2025 16:3369,778608,614,036521,143,00058,015,0002,387,968