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 06:54Saif Al-HarthiSaif Al-HarthiScore: 11,701Success
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 06:5511,690106,454,34496,024,0001,011,0002,113,536
2Jun 30, 2026 06:5511,697106,406,46596,079,0001,010,0002,113,536
3Jun 30, 2026 06:5511,697106,385,35896,082,0001,011,0002,113,536
4Jun 30, 2026 06:5511,700106,433,36696,100,0001,012,0002,113,536
5Jun 30, 2026 06:5511,701106,427,60696,113,0001,010,0002,113,536
6Jun 30, 2026 06:5511,705106,564,67196,145,0001,012,0002,113,536
7Jun 30, 2026 06:5511,718106,543,81596,248,0001,012,0002,113,536
8Jun 30, 2026 06:5511,721106,588,96296,280,0001,012,0002,113,536
9Jun 30, 2026 06:5511,724106,663,91796,304,0001,010,0002,113,536