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 1, 2026 04:14Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 17,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 04:1417,614156,870,16087,147,00059,052,0002,113,536
2Nov 1, 2026 04:1417,617156,896,09387,587,00058,641,00020,480
3Nov 1, 2026 04:1417,691157,483,94587,424,00059,417,00020,480
4Nov 1, 2026 04:1417,696157,505,73287,533,00059,347,00020,480
5Nov 1, 2026 04:1417,745157,986,23987,554,00059,736,00020,480
6Nov 1, 2026 04:1417,793158,373,42587,271,00060,412,00020,480
7Nov 1, 2026 04:1417,821158,662,78587,268,00060,650,00020,480
8Nov 1, 2026 04:1417,972159,926,52087,408,00061,767,00020,480
9Nov 1, 2026 04:1417,988159,971,83887,053,00062,248,00020,480