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 listOct 14, 2026 11:49highload-churnerhighload-churnerScore: 28,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 11:5028,400244,625,121235,727,000024,576stderr
2Oct 14, 2026 11:5028,421244,860,780235,896,000024,576stderr
3Oct 14, 2026 11:5028,422244,904,478235,909,000024,576stderr
4Oct 14, 2026 11:5028,458246,690,139236,206,000024,576stderr
5Oct 14, 2026 11:5028,468245,225,943236,285,000024,576stderr
6Oct 14, 2026 11:5028,478245,825,691236,374,000024,576stderr
7Oct 14, 2026 11:5028,489245,518,487236,462,000024,576stderr
8Oct 14, 2026 11:5028,560246,049,907236,005,0001,047,00024,576stderr
9Oct 14, 2026 11:5028,688247,230,453237,115,0001,002,00024,576stderr