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 listMar 18, 2026 01:39Elijah KinElijah KinScore: 52,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:3952,017458,655,798427,745,0003,997,0002,273,280
2Mar 18, 2026 01:3952,031457,005,267430,857,000999,0002,273,280
3Mar 18, 2026 01:3952,032458,731,561429,865,0001,999,0002,269,184
4Mar 18, 2026 01:3952,034454,613,905430,880,000999,0002,506,752
5Mar 18, 2026 01:3952,035453,437,515429,895,0001,999,0002,273,280
6Mar 18, 2026 01:3952,037450,750,471429,905,0001,999,0002,273,280
7Mar 18, 2026 01:3952,040457,335,158429,936,0001,999,0002,265,088
8Mar 18, 2026 01:3952,040455,103,201428,932,0002,999,0002,273,280
9Mar 18, 2026 01:3952,044466,427,065429,963,0001,999,0002,277,376