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 listJan 12, 2026 18:58Alexander FrolovAlexander FrolovScore: 25,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 18:5825,512240,242,855210,746,0001,003,0002,486,272
2Jan 12, 2026 18:5825,514238,059,217210,764,0001,003,0002,486,272
3Jan 12, 2026 18:5825,515239,143,118209,777,0001,997,0002,269,184