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 22, 2026 12:37Omkar SinghOmkar SinghScore: 147,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 12:37147,6681,234,767,3611,167,321,00058,328,0002,113,536
2Jun 22, 2026 12:37147,7451,235,416,6221,167,240,00059,051,0002,113,536
3Jun 22, 2026 12:37147,7451,235,407,7371,167,265,00059,025,0002,113,536
4Jun 22, 2026 12:37147,8001,235,882,5931,167,366,00059,376,0002,113,536
5Jun 22, 2026 12:37147,8611,236,329,0221,167,288,00059,963,0002,113,536
6Jun 22, 2026 12:37147,8651,236,447,0271,167,429,00059,854,0002,113,536
7Jun 22, 2026 12:37147,8701,236,396,5621,167,268,00060,056,0002,113,536
8Jun 22, 2026 12:37147,8981,236,747,2331,167,296,00060,265,0002,113,536
9Jun 22, 2026 12:37147,9451,237,014,4801,167,241,00060,705,0002,113,536