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 03:44Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 27,126Success
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 03:4627,015234,887,684164,729,00059,499,00020,480
2Nov 1, 2026 03:4627,030235,121,324164,697,00059,652,00020,480
3Nov 1, 2026 03:4627,051235,192,865164,712,00059,819,00020,480
4Nov 1, 2026 03:4627,098235,514,735164,666,00060,249,00020,480
5Nov 1, 2026 03:4627,126235,873,329164,784,00060,369,0002,113,536
6Nov 1, 2026 03:4627,131237,744,338164,646,00060,544,00020,480
7Nov 1, 2026 03:4627,132235,910,289164,730,00060,471,0002,113,536
8Nov 1, 2026 03:4627,167236,140,078164,826,00060,665,0002,113,536
9Nov 1, 2026 03:4627,199236,420,734164,799,00060,959,0002,113,536