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 6, 2024 10:37Evgen BodunovEvgen BodunovScore: 62,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:3761,494536,482,222507,408,0002,996,0002,281,472
2Nov 6, 2024 10:3761,887539,290,929511,660,0001,998,0002,281,472
3Nov 6, 2024 10:3761,984546,432,543512,472,0001,997,0002,510,848
4Nov 6, 2024 10:3762,023545,194,514512,790,0001,999,0002,510,848
5Nov 6, 2024 10:3762,030545,126,571511,854,0002,999,0002,281,472
6Nov 6, 2024 10:3762,056549,477,971513,066,0002,000,0002,281,472
7Nov 6, 2024 10:3762,081541,287,332514,269,0001,000,0002,289,664
8Nov 6, 2024 10:3762,105546,035,755512,477,0002,996,0002,281,472
9Nov 6, 2024 10:3762,119547,137,524513,586,0001,998,0002,281,472