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 8, 2026 17:48Alexander FrolovAlexander FrolovScore: 81,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 17:4881,213695,712,264673,068,0001,000,0002,277,376
2Jan 8, 2026 17:4881,231697,532,060673,215,0001,000,0002,494,464
3Jan 8, 2026 17:4881,267700,695,341672,516,0001,998,0002,273,280