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 05:45Saif Al-HarthiSaif Al-HarthiScore: 22,283Success
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 05:4622,205193,636,666183,299,0001,004,0002,113,536
2Jun 30, 2026 05:4622,250194,388,497183,672,0001,005,0002,113,536
3Jun 30, 2026 05:4622,263194,070,416183,783,0001,006,0002,113,536
4Jun 30, 2026 05:4622,267195,492,934183,815,0001,005,0002,113,536
5Jun 30, 2026 05:4622,283194,511,474183,947,0001,004,0002,113,536
6Jun 30, 2026 05:4622,294194,439,249184,037,0001,005,0002,113,536
7Jun 30, 2026 05:4622,296194,374,478184,053,0001,007,0002,113,536
8Jun 30, 2026 05:4622,432195,471,128185,183,0001,005,0002,113,536
9Jun 30, 2026 05:4622,598196,885,038186,564,0001,005,0002,113,536