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 24, 2021 19:10Roman LytkinRoman LytkinScore: 848,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2021 19:10846,0097,091,194,5067,021,878,42802,244,608
2Nov 24, 2021 19:10848,0727,115,148,1577,038,996,94102,248,704
3Nov 24, 2021 19:10852,4107,148,758,7477,075,006,86902,232,320