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 listMay 7, 2024 09:12Andrei LuzanAndrei LuzanScore: 82,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2024 10:4082,838760,132,227687,553,45402,232,320
2May 7, 2024 09:0982,848755,146,487687,637,03402,269,184
3May 8, 2024 10:4082,869735,176,420687,815,67302,248,704
4May 7, 2024 09:1282,886751,698,387687,950,76302,256,896
5May 8, 2024 10:4082,906750,442,981688,118,20002,240,512
6May 7, 2024 09:0982,960760,700,215688,570,01402,265,088
7May 7, 2024 09:0982,999745,169,174688,888,39202,252,800
8May 7, 2024 09:1283,173752,700,504690,332,59402,236,416
9May 7, 2024 09:1283,353752,290,847691,828,68302,256,896