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 listNov 25, 2025 09:46Ham-HamHam-HamScore: 51,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 10:0251,064446,442,342420,833,0002,998,0002,273,280
2Nov 25, 2025 09:4651,103447,152,864423,157,0001,000,0002,490,368
3Nov 25, 2025 10:0251,114441,493,962423,243,0001,000,0002,498,560
4Nov 25, 2025 10:0251,116456,306,112423,265,0001,000,0002,490,368
5Nov 25, 2025 10:0251,118448,907,704423,283,0001,000,0002,498,560
6Nov 25, 2025 10:0251,131449,007,524423,384,0001,000,0002,531,328
7Nov 25, 2025 10:0251,156452,430,126422,597,0001,998,0002,490,368
8Nov 25, 2025 10:0251,157450,805,588422,604,0001,998,0002,273,280
9Nov 25, 2025 10:0251,161452,026,453422,638,0001,998,0002,535,424
10Nov 25, 2025 10:0251,351451,234,583425,210,0001,000,0002,273,280
11Nov 25, 2025 09:4651,356451,883,489425,256,0001,000,0002,273,280
12Nov 25, 2025 09:4651,442450,637,269424,971,0001,999,0002,490,368