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 15, 2026 17:21Jonathan GopelJonathan GopelScore: 62,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 17:2162,598547,503,202517,568,0001,998,0002,355,200
2Jan 15, 2026 17:2162,642544,123,516518,933,000999,0002,473,984
3Jan 15, 2026 17:2162,664545,358,077519,115,0001,000,0002,371,584
4Jan 15, 2026 17:2162,686546,352,448519,296,0001,000,0002,289,664
5Jan 15, 2026 17:2162,696545,911,528519,373,0001,000,0002,359,296
6Jan 15, 2026 17:2162,696547,603,626519,379,0001,000,0002,289,664
7Jan 15, 2026 17:2162,702544,654,131519,426,0001,000,0002,473,984
8Jan 15, 2026 17:2162,723553,346,192519,601,000999,0002,355,200
9Jan 15, 2026 17:2162,726548,388,865520,624,00002,289,664