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 listAug 5, 2025 23:36Leon ZhaoLeon ZhaoScore: 55,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 23:3655,636484,325,464457,783,0003,998,0002,379,776
2Aug 5, 2025 23:3655,677483,178,656460,120,0002,000,0002,510,848
3Aug 5, 2025 23:3655,684484,456,057461,181,0001,000,0002,379,776
4Aug 5, 2025 23:3655,687489,181,119461,201,0001,000,0002,256,896
5Aug 5, 2025 23:3655,689484,565,467460,222,0002,000,0002,519,040
6Aug 5, 2025 23:3655,695489,771,897462,268,00002,510,848
7Aug 5, 2025 23:3655,700488,968,023461,308,0001,000,0002,379,776
8Aug 5, 2025 23:3655,700485,562,848462,312,00002,379,776
9Aug 5, 2025 23:3655,710487,066,467460,393,0002,001,0002,519,040