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 31, 2026 18:00olliecrowolliecrowScore: 7,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 18:006,64583,252,58953,152,0002,005,0002,281,472
2Jan 31, 2026 18:006,66484,882,20151,293,0004,022,0002,351,104
3Jan 31, 2026 18:006,75584,997,62053,060,0003,003,0002,318,336
4Jan 31, 2026 18:007,01889,975,64856,245,0002,008,0002,457,600
5Jan 31, 2026 18:007,04789,390,26654,453,0004,033,0002,379,776
6Jan 31, 2026 18:007,05588,325,13355,528,0003,028,0002,478,080