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 listAug 11, 2026 15:31RabenknechtRabenknechtScore: 52,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:3151,426436,965,258425,799,0001,041,0002,113,536
2Aug 11, 2026 15:3151,450437,832,840426,036,0001,004,0002,113,536
3Aug 11, 2026 15:3151,679439,736,198427,937,0001,002,0002,113,536
4Aug 11, 2026 15:3152,322445,096,908433,269,0001,008,0002,113,536
5Aug 11, 2026 15:3152,452445,344,782434,322,0001,031,0002,113,536
6Aug 11, 2026 15:3152,470446,420,688434,462,0001,043,0002,113,536
7Aug 11, 2026 15:3152,478446,354,921434,566,0001,007,0002,113,536
8Aug 11, 2026 15:3152,478446,520,796434,559,0001,010,0002,113,536
9Aug 11, 2026 15:3152,481445,652,284434,595,0001,003,0002,113,536