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 listFeb 24, 2026 19:35wnwnScore: 8,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:355,94269,157,40848,316,0001,006,0002,494,464
2Feb 24, 2026 19:358,46393,251,80869,239,0001,003,0002,535,424
3Feb 24, 2026 19:359,14498,309,24373,896,0001,997,0002,486,272