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 19:00A_ShamanA_ShamanScore: 67,095Success
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 19:0066,846563,906,723494,119,00060,705,0002,113,536
2Jun 20, 2026 19:0066,913564,583,352493,930,00061,454,0002,113,536
3Jun 20, 2026 19:0067,033565,480,662494,679,00061,700,0002,113,536
4Jun 20, 2026 19:0067,041565,423,767494,370,00062,076,0002,113,536
5Jun 20, 2026 19:0067,095565,939,110494,731,00062,165,0002,113,536
6Jun 20, 2026 19:0067,099566,028,323494,892,00062,035,0002,113,536
7Jun 20, 2026 19:0067,099565,966,536494,947,00061,975,0002,113,536
8Jun 20, 2026 19:0067,136566,388,669493,751,00063,479,0002,113,536
9Jun 20, 2026 19:0067,158566,599,544494,892,00062,523,0002,113,536