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 listApr 23, 2025 18:52Alona MalohAlona MalohScore: 522,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 18:52522,2034,362,278,3854,277,312,00056,977,0002,281,472
2Apr 23, 2025 18:52522,3414,361,163,6774,256,460,00078,971,0002,289,664
3Apr 23, 2025 18:52522,5524,365,134,8714,262,215,00074,968,0002,277,376
4Apr 23, 2025 18:52522,5854,365,878,0964,270,479,00066,976,0002,277,376
5Apr 23, 2025 18:52522,6864,365,444,2694,267,322,00070,972,0002,277,376
6Apr 23, 2025 18:52522,7634,368,720,8874,265,970,00072,965,0002,265,088
7Apr 23, 2025 18:52522,7644,363,815,0354,265,978,00072,965,0002,277,376
8Apr 23, 2025 18:52522,8324,365,268,7224,281,536,00057,966,0002,285,568
9Apr 23, 2025 18:52523,0914,367,813,2004,264,696,00076,958,0002,277,376