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 30, 2026 18:21Genos0Genos0Score: 67,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:2267,798572,086,747503,817,00058,912,0002,113,536
2Jun 30, 2026 18:2267,861572,601,636503,697,00059,550,0002,113,536
3Jun 30, 2026 18:2267,887572,873,162503,631,00059,836,0002,113,536
4Jun 30, 2026 18:2267,892573,029,956502,960,00060,549,0002,113,536
5Jun 30, 2026 18:2267,907572,943,058503,688,00059,947,0002,113,536
6Jun 30, 2026 18:2267,942573,256,959503,724,00060,198,0002,113,536
7Jun 30, 2026 18:2267,966573,532,047503,933,00060,185,0002,113,536
8Jun 30, 2026 18:2268,014573,832,087504,033,00060,487,0002,113,536
9Jun 30, 2026 18:2268,083574,500,408503,945,00061,145,0002,113,536