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 listJun 20, 2026 18:51A_ShamanA_ShamanScore: 75,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:5274,922630,954,642562,163,00059,690,0002,113,536
2Jun 20, 2026 18:5275,013631,819,151562,772,00059,842,0002,113,536
3Jun 20, 2026 18:5275,058632,200,590562,759,00060,227,0002,113,536
4Jun 20, 2026 18:5275,088632,770,097562,219,00061,018,0002,113,536
5Jun 20, 2026 18:5275,138633,202,429563,290,00060,358,0002,113,536
6Jun 20, 2026 18:5275,215633,701,135563,491,00060,797,0002,113,536
7Jun 20, 2026 18:5275,244633,619,466563,388,00061,138,0002,113,536
8Jun 20, 2026 18:5275,251633,682,515563,935,00060,652,0002,113,536
9Jun 20, 2026 18:5275,271633,819,124562,887,00061,870,0002,113,536