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 18:31bruHFTbruHFTScore: 154,392Success
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 18:31154,1871,308,645,8211,045,982,000233,772,0002,330,624
2Nov 6, 2024 18:31154,2001,312,798,8231,046,066,000233,791,0002,465,792
3Nov 6, 2024 18:31154,3551,307,057,5991,048,305,000232,845,0002,445,312
4Nov 6, 2024 18:31154,3581,306,905,1351,047,322,000233,848,0002,314,240
5Nov 6, 2024 18:31154,3921,317,093,7771,047,556,000233,901,0002,465,792
6Nov 6, 2024 18:31154,4151,314,985,1331,047,892,000233,752,0002,408,448
7Nov 6, 2024 18:31154,4671,308,521,5211,045,248,000236,829,0002,347,008
8Nov 6, 2024 18:31154,5131,308,883,7071,045,557,000236,899,0002,502,656
9Nov 6, 2024 18:31154,7821,311,278,2351,045,937,000238,757,0002,412,544