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 listOct 15, 2024 00:06Joad NacerJoad NacerScore: 4,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 00:064,36861,226,28534,239,0002,014,0002,535,424
2Oct 15, 2024 00:064,39660,965,97136,489,00002,404,352
3Oct 15, 2024 00:064,41764,558,71435,643,0001,018,0002,269,184
4Oct 15, 2024 00:064,50262,330,84837,367,00002,527,232
5Oct 15, 2024 00:064,50554,206,77337,392,00002,531,328
6Oct 15, 2024 00:064,57366,300,63536,927,0001,025,0002,400,256