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 8, 2026 12:04chereshnya123chereshnya123Score: 58,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 12:0458,404493,817,270427,071,00057,683,0002,113,536
2Jun 8, 2026 12:0458,454494,232,570427,442,00057,728,0002,113,536
3Jun 8, 2026 12:0458,469494,410,678427,470,00057,826,0002,113,536
4Jun 8, 2026 12:0458,493494,711,802427,023,00058,470,0002,113,536
5Jun 8, 2026 12:0458,502494,702,976427,456,00058,117,0002,113,536
6Jun 8, 2026 12:0458,529494,947,297427,361,00058,436,0002,113,536
7Jun 8, 2026 12:0458,532494,955,606427,535,00058,284,0002,113,536
8Jun 8, 2026 12:0458,587495,403,269427,361,00058,916,0002,113,536
9Jun 8, 2026 12:0458,614495,630,155427,498,00059,000,0002,113,536