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 22:47Dmitry YudakovDmitry YudakovScore: 75,942Success
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 22:4775,889658,923,615627,879,0001,999,0002,297,856
2Apr 23, 2025 22:4775,915657,759,414629,097,0001,000,0002,547,712
3Apr 23, 2025 22:4775,926657,585,548628,183,0002,000,0002,543,616
4Apr 23, 2025 22:4775,928659,825,607629,200,0001,000,0002,543,616
5Apr 23, 2025 22:4775,942663,887,517628,320,0002,001,0002,527,232
6Apr 23, 2025 22:4775,948657,547,594628,370,0002,001,0002,535,424
7Apr 23, 2025 22:4775,968662,230,315629,534,000999,0002,539,520
8Apr 23, 2025 22:4775,974658,961,657630,586,00002,289,664
9Apr 23, 2025 22:4775,983658,783,664629,664,000999,0002,297,856