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 9, 2026 18:34AVGAVGScore: 46,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:3446,357414,341,297383,764,000999,0002,277,376
2Jan 9, 2026 18:3446,540419,916,150386,283,00002,277,376
3Jan 9, 2026 18:3446,578411,873,091385,596,000998,0002,277,376
4Jan 9, 2026 18:3446,583415,652,176385,638,000999,0002,277,376
5Jan 9, 2026 18:3446,583417,575,647385,642,000999,0002,400,256
6Jan 9, 2026 18:3446,624408,179,440385,981,000999,0002,277,376
7Jan 9, 2026 18:3446,636410,680,573387,082,00002,387,968
8Jan 9, 2026 18:3446,641413,601,510386,118,0001,000,0002,396,160
9Jan 9, 2026 18:3446,661411,341,070386,290,0001,000,0002,277,376