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 listJul 17, 2026 03:37Kevin HeaveyKevin HeaveyScore: 3,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:403,69040,315,83429,450,0001,177,0002,117,632
2Jul 17, 2026 03:403,69340,466,07629,640,0001,020,0002,117,632
3Jul 17, 2026 03:403,69540,379,36829,399,0001,277,0002,117,632
4Jul 17, 2026 03:403,69740,418,71129,664,0001,022,0002,117,632
5Jul 17, 2026 03:403,70040,514,46829,492,0001,224,0002,117,632
6Jul 17, 2026 03:403,71840,578,88929,675,0001,185,0002,117,632
7Jul 17, 2026 03:403,72040,616,93329,676,0001,201,0002,117,632
8Jul 17, 2026 03:403,77041,053,49830,252,0001,040,0002,117,632
9Jul 17, 2026 03:403,77241,018,84030,076,0001,233,0002,117,632