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 listJul 27, 2024 23:06Lickety SplitLickety SplitScore: 553,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 23:06544,42915,288,457,0004,518,758,85202,232,320
2Jul 27, 2024 23:06553,87615,640,937,6464,597,173,86702,240,512
3Jul 27, 2024 23:06554,91515,983,886,3364,605,796,24702,310,144